#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const int inf = 1e9 + 7;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll pow(ll a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { for (auto &vi: vec) os << vi << " "; return os; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T, class T2> inline void add(T &a, T2 b) { a += b; if (a >= mod) a -= mod; }


void solve();

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(10);

  int T;
  // cin >> T;
  T = 1;

  while (T--) {
    solve();
  }
}

struct intersectPoint {
  // -1, 0, 1 ごとの max, min
  vector<int> mi, ma;
  intersectPoint() : mi(3, inf), ma(3, -inf) {} // ここで初期化しなあかん
  void change(int x, int d) {
    d++;
    chmin(mi[d], x);
    chmax(ma[d], x);
  }
  vector<double> ts_() {
    vector<double> ret;
    rep(i, 3) rep(j, i) {
      // mi[i] + (i - 1) * t = mi[j] * (j - 1) * t
      double t = (mi[i] - mi[j]) * 1.0 / (j - i);
      if (t < 0) continue;
      ret.eb(t);
    }
    rep(i, 3) rep(j, i) {
      // mi[i] + (i - 1) * t = mi[j] * (j - 1) * t
      double t = (ma[i] - mi[j]) * 1.0 / (j - i);
      if (t < 0) continue;
      ret.eb(t);
    }
    rep(i, 3) rep(j, i) {
      // mi[i] + (i - 1) * t = mi[j] * (j - 1) * t
      double t = (ma[i] - ma[j]) * 1.0 / (j - i);
      if (t < 0) continue;
      ret.eb(t);
    }
    ret.eb(0); // 交差しない場合
    return ret;
  }
  double wid(double t) {
    double nl = inf, nr = -inf;
    rep(i, 3) {
      chmin(nl, mi[i] + (i - 1) * t);
      chmax(nr, ma[i] + (i - 1) * t);
    }
    return nr - nl;
  }
};

// youtube editorial
void solve() {
  int n;
  cin >> n;
  intersectPoint xs, ys;
  rep(i, n) {
    int x, y;
    char d;
    cin >> x >> y >> d;
    // x, y 方向 -1, 0, 1 の max, min の座標
    if (d == 'L') { xs.change(x, -1); ys.change(y, 0); }
    else if (d == 'R') { xs.change(x, 1); ys.change(y, 0); }
    else if (d == 'U') { xs.change(x, 0); ys.change(y, 1); }
    else { xs.change(x, 0); ys.change(y, -1); }
  }
  // 端を担う点が変わる時刻列挙
  auto ts = xs.ts_();
  auto ts2 = ys.ts_();
  ts.insert(ts.end(), all(ts2));
  // cout << ts << endl;
  double ans = INF;
  for (double t : ts) {
    chmin(ans, xs.wid(t) * ys.wid(t));
  }
  cout << ans << endl;
}


Measured memory_bytes: 256