#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formax=(b);i>=i##formax;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max((x),(y))
#define mins(x,y) x=min((x),(y))
#define show(x) cout<<#x<<" = "<<x<<endl;
#define all(a) ((a).begin()),((a).end())
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define bitComb(a,n,k) for(int a##x,a##y,a=(1<<k)-1;a<(1<<n);a##x=a&-a,a##y=a+a##x,a=(((a&~a##y)/a##x)>>1)|a##y)
#define bit(n) (1LL<<(n))
typedef long long ll;
typedef __int128_t lll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;
template<class T,class Y>ostream& operator<<(ostream&o,const pair<T,Y>&p){return o<<"("<<p.fi<<","<<p.se<<")";}
template<class T>ostream& operator<<(ostream&o,V<T>&v){for(T&t:v)o<<t<<",";return o<<endl;}
template<class T>void uniq(V<T>&v){sort(all(v));v.erase(unique(all(v)), v.end());}
mt19937 rnd(random_device{}());

lll gcd(lll a,lll b,lll&x,lll&y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}
ll modInv(ll a,ll m){lll x,y;gcd(a,m,x,y);return(x%m+m)%m;}
ll modPow(lll a,lll n,ll m){lll p=1;for(;n;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return p;}
bool isPrime(ll n){if(n<2||n%2==0)return n==2;lll t=n-1,d=t/(t&-t);for(lll a:{2,325,9375,28178,450775,9780504,1795265022})if(a%n){for(t=d,a=modPow(a,t,n);t!=n-1&&a!=1&&a!=n-1;a=a*a%n,t=t*2%n);if(a!=n-1&&t%2==0)return 0;}return 1;}
V<ll>fac,rfac; void setFac(int n,int mod){fac=rfac=V<ll>(++n);fac[0]=1;FOR(i,1,n)fac[i]=fac[i-1]*i%mod;rfac[n-1]=modInv(fac[n-1],mod);FORR(i,n-1,1)rfac[i-1]=rfac[i]*i%mod;}

ll randInt(ll l,ll r){return uniform_int_distribution<ll>(l,r)(rnd);}
double randDouble(double l,double r){return uniform_real_distribution<double>(l,r)(rnd);}
void dout(double d){printf("%.12f\n",d);}

const double PI = acos(-1);
const double EPS = 1e-10;
const int IINF = 1e9+6;
const ll LINF = 1e18;
const int MOD = 1e9+7; //998244353;

const int N = 1e5;
int n;
ll x[N], y[N];
char d[N];
V<pll> lines(char U, char D){
  ll au=-IINF, a=-IINF, ad=-IINF, iu=IINF, i=IINF, id=IINF;
  FOR(j, 0, n){
    if(d[j]==U){
      maxs(au, y[j]);
      mins(iu, y[j]);
    }else if(d[j]==D){
      maxs(ad, y[j]);
      mins(id, y[j]);
    }else{
      maxs(a, y[j]);
      mins(i, y[j]);
    }
  }
  V<pll> ret;
  ret.pb({-2, ad-iu});
  ret.pb({-1, max(a-iu, ad-i)});
  ret.pb({ 0, max(au-iu, max(a-i, ad-id))});
  ret.pb({ 1, max(au-i, a-id)});
  ret.pb({ 2, au-id});
  return ret;
}
double ans = LINF;
void check(double t){
  if(t<0.0) return;
  double ax=-IINF, ay=-IINF, ix=IINF, iy=IINF;
  FOR(i, 0, n){
    double _x = x[i], _y = y[i];
    if(d[i]=='U') _y += t;
    if(d[i]=='D') _y -= t;
    if(d[i]=='R') _x += t;
    if(d[i]=='L') _x -= t;
    maxs(ax, _x);
    maxs(ay, _y);
    mins(ix, _x);
    mins(iy, _y);
  }
  mins(ans, (ax-ix)*(ay-iy));
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  FOR(i, 0, n) cin >> x[i] >> y[i] >> d[i];
  V<pll> l1 = lines('U', 'D');
  swap(x, y);
  V<pll> l2 = lines('R', 'L');
  swap(x, y);
  check(0.0);
  for(auto a:l1)for(auto b:l2){
    if(a.fi==0 && b.fi==0) continue;
    if(a.fi!=0 && b.fi==0) check(-(double)a.se/a.fi);
    if(a.fi==0 && b.fi!=0) check(-(double)b.se/b.fi);
    if(a.fi!=0 && b.fi!=0) check((-(double)a.se/a.fi-(double)b.se/b.fi)/2);
  }
  FOR(i, 0, 4)FOR(j, i+1, 5){
    check((double)(l1[j].se-l1[i].se)/(l1[i].fi-l1[j].fi));
    check((double)(l2[j].se-l2[i].se)/(l2[i].fi-l2[j].fi));
  }
  dout(ans);
}

Measured memory_bytes: 1920