#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define revrep(i, n) for(int i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);

//const ll INFL = LLONG_MAX;//10^18 = 2^60
const ll INFL = 1LL<<60;
//const int INF = INT_MAX;
const int INF = 1 << 30;//10^9
ll MOD = 1000000007;
//ll MOD = 998244353;
double EPS = 1e-11;

vector<ll> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};

void pres(double A){printf("%.12lf\n", A);}
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll cnt_bit(ll x){return __builtin_popcountll(x);}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x; k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  x %= MOD;
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){
  ll res = x / gcd(x, y);
  res *= y;
  return res;
};


//コンビネーション
const int MAXcomb = 2000010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}

const int MAXkai = 200010;
ll kai_memo[MAXkai];
ll kai(ll N){
  if(kai_memo[N] != 0) return kai_memo[N];
  if(N <= 1) return 1;
  return kai_memo[N] = N * kai(N-1) % MOD;
}

ll disit(ll s, ll base = 10){
  ll res = 0;
  while(s){
    res++;
    s /= base;
  }
  return res;
}


double P(ll a, ll b, ll c, ll d){
  if(abs(c) > INF || abs(d) > INF) return 0;
  return max((double)0, 1.0 * (d - b) / (a - c));
}

ll N;
double xa = -INFL, xb = -INFL, xc = -INFL;
double xd = INFL, xe = INFL, xf = INFL;
double ya = -INFL, yb = -INFL, yc = -INFL;
double yd = INFL, ye = INFL, yf = INFL;

double calc_x(double T){
  double M = max(xa-T, max(xb, xc+T));
  double m = min(xd+T, min(xe, xf-T));
  return M - m;
}
double calc_y(double T){
  double M = max(ya-T, max(yb, yc+T));
  double m = min(yd+T, min(ye, yf-T));
  return M - m;
}

double calc(double T){
  double X = calc_x(T);
  double Y = calc_y(T);
  return X * Y;
}

void solve(){
  cin >> N;
  rep(i, N){
    double x, y;
    char d;
    cin >> x >> y >> d;
    if(d == 'L'){
      xa = max(xa, x);
      xf = min(xf, x);
      yb = max(yb, y);
      ye = min(ye, y);
    }
    if(d == 'R'){
      xc = max(xc, x);
      xd = min(xd, x);
      yb = max(yb, y);
      ye = min(ye, y);
    }
    if(d == 'D'){
      xb = max(xb, x);
      xe = min(xe, x);
      ya = max(ya, y);
      yf = min(yf, y);
    }
    if(d == 'U'){
      xb = max(xb, x);
      xe = min(xe, x);
      yc = max(yc, y);
      yd = min(yd, y);
    }
  }

  vector<double> T;
  T.pb(P(-1, xa, 0, xb));
  T.pb(P(-1, xa, 1, xc));
  T.pb(P(0, xb, 1, xc));
  T.pb(P(1, xd, 0, xe));
  T.pb(P(1, xd, -1, xf));
  T.pb(P(0, xe, -1, xf));
  T.pb(P(-1, ya, 0, yb));
  T.pb(P(-1, ya, 1, yc));
  T.pb(P(0, yb, 1, yc));
  T.pb(P(1, yd, 0, ye));
  T.pb(P(1, yd, -1, yf));
  T.pb(P(0, ye, -1, yf));

  sort(T.begin(), T.end());
  double ans = 1.0 * INFL;
  rep(i, T.size() - 1){
    if(T[i] < 0) continue;
    double left = T[i], right = T[i+1];
    left = max(left, (double)0);
    right = max(right, (double)0);
    rep(_, 1000){
      double mid1 = (left * 2 + right) / 3, mid2 = (left + 2 * right) / 3;
      if(calc(mid1) < calc(mid2)) right = mid2;
      else left = mid1;
    }
    ans = min(ans, calc(left));
  }
  pres(ans);
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
}


Measured memory_bytes: 384