#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define EPS 1e-9
//#define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
	for (int i = 0; i < A.size(); i++)
		os << A[i] << " ";
	os << endl;
	return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
	int N = A.size();
	int M;
	if (N > 0)
		M = A[0].size();
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++)
			os << A[i][j] << " ";
		os << endl;
	}
	return os;
}

typedef pair< int, int > pii;
typedef long long ll;

struct edge {
	int from, to, d, c;
	edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
		from = _from;
		to = _to;
		d = _d;
		c = _c;
	}
	bool operator<(const edge &rhs) const {
		return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
	}
};
struct aabb {
	int x1, y1, x2, y2;
	aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
	int to, cap, rev, cost;
	flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template < typename T, typename U >
bool chmin(T &x, const U &y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}

struct initializer {
	initializer() {
		cout << fixed << setprecision(20);
	}
};
initializer _____;

int N, M, K, T, Q, H, W;
signed main() {
	cin >> N;
	vector< vector< int > > X(3), Y(3);
	rep(i, N) {
		int x, y;
		char d;
		cin >> x >> y >> d;
		x *= 2;
		y *= 2;
		switch (d) {
		case 'R': {
			X[2].push_back(x);
			Y[1].push_back(y);
			break;
		}
		case 'L': {
			X[0].push_back(x);
			Y[1].push_back(y);
			break;
		}
		case 'U': {
			X[1].push_back(x);
			Y[2].push_back(y);
			break;
		}
		case 'D': {
			X[1].push_back(x);
			Y[0].push_back(y);
			break;
		}
		}
	}
	rep(i, 3) {
		sort(X[i].begin(), X[i].end());
		sort(Y[i].begin(), Y[i].end());
	}
	vector< int > T;
	T.push_back(0);
	T.push_back(INF);
	rep(i, 3) rep(j, 3) if (i < j) {
		if (X[i].size() > 0 && X[j].size() > 0) {
			if (i == 0 && j == 2) {
				T.push_back((X[i][0] - X[j][0]) / 2);
				T.push_back((X[i][X[i].size() - 1] - X[j][0]) / 2);
				T.push_back((X[i][0] - X[j][X[j].size() - 1]) / 2);
				T.push_back((X[i][X[i].size() - 1] - X[j][X[j].size() - 1]) / 2);
			} else {
				T.push_back((X[i][0] - X[j][0]));
				T.push_back((X[i][X[i].size() - 1] - X[j][0]));
				T.push_back((X[i][0] - X[j][X[j].size() - 1]));
				T.push_back((X[i][X[i].size() - 1] - X[j][X[j].size() - 1]));
			}
		}
	}
	rep(i, 3) rep(j, 3) if (i < j) {
		if (Y[i].size() > 0 && Y[j].size() > 0) {
			if (i == 0 && j == 2) {
				T.push_back((Y[i][0] - Y[j][0]) / 2);
				T.push_back((Y[i][Y[i].size() - 1] - Y[j][0]) / 2);
				T.push_back((Y[i][0] - Y[j][Y[j].size() - 1]) / 2);
				T.push_back((Y[i][Y[i].size() - 1] - Y[j][Y[j].size() - 1]) / 2);
			} else {
				T.push_back((Y[i][0] - Y[j][0]));
				T.push_back((Y[i][Y[i].size() - 1] - Y[j][0]));
				T.push_back((Y[i][0] - Y[j][Y[j].size() - 1]));
				T.push_back((Y[i][Y[i].size() - 1] - Y[j][Y[j].size() - 1]));
			}
		}
	}
	int ans = LINF;
	for (auto t : T) {
		if (t < 0)
			continue;
		int xmax = -LINF, xmin = LINF, ymax = -LINF, ymin = LINF;
		rep(k, 3) {
			rep(i, X[k].size()) {
				int x = X[k][i] + (k - 1) * t;
				chmax(xmax, x);
				chmin(xmin, x);
			}
			rep(i, Y[k].size()) {
				int y = Y[k][i] + (k - 1) * t;
				chmax(ymax, y);
				chmin(ymin, y);
			}
		}
		chmin(ans, (xmax - xmin) * (ymax - ymin));
	}
	cout << (double)ans / 4 << endl;
	return 0;
}

Measured memory_bytes: 2288