#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> inline T bis(T ok, T ng, function<bool(T)> f, T eps = 1) { while (abs(ok - ng) > eps) { T mi = (ok + ng) / 2; (f(mi) ? ok : ng) = mi; } return ok; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

const int INF = 1e9;

void solve() {
  int N;
  cin >> N;
  vi32 pa(12);
  pa[0]  = pa[1]  = pa[2]  = -INF;
  pa[3]  = pa[4]  = pa[5]  = INF;
  pa[6]  = pa[7]  = pa[8]  = -INF;
  pa[9]  = pa[10] = pa[11] = INF;
  int xma = -INF;
  int yma = -INF;
  int xmi = INF;
  int ymi = INF;
  rep(i, N) {
    int x, y;
    char d;
    cin >> x >> y >> d;
    amax(xma, x), amin(xmi, x);
    amax(yma, y), amin(ymi, y);
    switch (d) {
      case 'R':
        if (pa[0]  == INF) { pa[0]  = x; } else { amax(pa[0],  x); }
        if (pa[4]  == INF) { pa[4]  = x; } else { amin(pa[4],  x); }
        if (pa[8]  == INF) { pa[8]  = y; } else { amax(pa[8],  y); }
        if (pa[11] == INF) { pa[11] = y; } else { amin(pa[11], y); }
        break;
      case 'L':
        if (pa[1]  == INF) { pa[1]  = x; } else { amax(pa[1],  x); }
        if (pa[3]  == INF) { pa[3]  = x; } else { amin(pa[3],  x); }
        if (pa[8]  == INF) { pa[8]  = y; } else { amax(pa[8],  y); }
        if (pa[11] == INF) { pa[11] = y; } else { amin(pa[11], y); }
        break;
      case 'U':
        if (pa[2]  == INF) { pa[2]  = x; } else { amax(pa[2],  x); }
        if (pa[5]  == INF) { pa[5]  = x; } else { amin(pa[5],  x); }
        if (pa[6]  == INF) { pa[6]  = y; } else { amax(pa[6],  y); }
        if (pa[10] == INF) { pa[10] = y; } else { amin(pa[10], y); }
        break;
      case 'D':
        if (pa[2]  == INF) { pa[2]  = x; } else { amax(pa[2],  x); }
        if (pa[5]  == INF) { pa[5]  = x; } else { amin(pa[5],  x); }
        if (pa[7]  == INF) { pa[7]  = y; } else { amax(pa[7],  y); }
        if (pa[9]  == INF) { pa[9]  = y; } else { amin(pa[9],  y); }
        break;
    }
  }
  i64 ans = 1e18;
  for (int t = 0; t <= 2 * max(xma - xmi, yma - ymi); t++) {
    i64 xmax = -INF, xmin = INF;
    i64 ymax = -INF, ymin = INF;
    amax(xmax, (i64) 2 * pa[0] + t);
    amax(xmax, (i64) 2 * pa[1] - t);
    amax(xmax, (i64) 2 * pa[2]);
    amin(xmin, (i64) 2 * pa[3] - t);
    amin(xmin, (i64) 2 * pa[4] + t);
    amin(xmin, (i64) 2 * pa[5]);
    amax(ymax, (i64) 2 * pa[6] + t);
    amax(ymax, (i64) 2 * pa[7] - t);
    amax(ymax, (i64) 2 * pa[8]);
    amin(ymin, (i64) 2 * pa[9] - t);
    amin(ymin, (i64) 2 * pa[10] + t);
    amin(ymin, (i64) 2 * pa[11]);

    amin(ans, (i64) (xmax - xmin) * (ymax - ymin));
  }
  cout << ans / 4.0 << endl;
}


Measured memory_bytes: 384