import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto xyd = new long[][](N, 3);
	auto toPos = ["R":0, "L":1, "U":2, "D":3];
	foreach (i; 0..N)
	{
		auto x = RD;
		auto y = RD;
		auto d = RD!string;
		xyd[i] = [x, y, toPos[d]];
	}

	double f(double t)
	{
		double xl = int.max, xr = int.min, yl = int.max, yr = int.min;
		foreach (i; 0..N)
		{
			auto pos = [cast(double)xyd[i][0], cast(double)xyd[i][1]];
			auto d   = xyd[i][2];
			if (d == 0)
				pos[0] += t;
			else if (d == 1)
				pos[0] -= t;
			else if (d == 2)
				pos[1] += t;
			else if (d == 3)
				pos[1] -= t;

			xl = min(xl, pos[0]);
			xr = max(xr, pos[0]);
			yl = min(yl, pos[1]);
			yr = max(yr, pos[1]);
		}
		auto result = (xr - xl) * (yr - yl);
		//debug writeln("result:(", xr, "-", xl, ")*(", yr, "-",yl, ")");
		return result;
	}

	double l = 0.0, r = 10^^7;
	double ly = int.max, ry = int.max;
	while (r + 1 - l >= 16.0)
	{
		if (ly > ry)
		{
			auto nl = l + (r + 1 - l) / 3.0;
			auto y  = f(nl);
			ly = y;
			l  = nl;
			debug writeln(ly);
		}
		else
		{
			auto nr = r - (r + 1 - l) / 3.0;
			/*debug writeln(l, ":", nr);
			if (nr == double.infinity)
			{
				assert(0);
			}*/
			auto y  = f(nr);
			ry = y;
			r  = nr;
			debug writeln(ry);
		}
	}

	double ans = int.max;
	//foreach (i; l..r+1)
	debug writeln(l, ":", r);
	long li = cast(long)(l * 100);
	long ri = cast(long)(r * 100);
	foreach (i; li..ri)
	{
		ans = min(ans, f(i / 100.0));
		//debug writeln(i, ":", ans);
	}

	writeln(ans);
	stdout.flush();
	debug readln();
}