#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;
#define RET(ans) {cout<<ans<<endl;return 0;} 


int biggest(double a,double b,double c){
    a = a+0.01;
    c = c-0.01;
    if(a>b&&a>c){
        return 1;
    }
    if(b>c){
        return 0;
    }
    return -1;
}
int smallest(double a,double b,double c){
    a = a+0.01;
    c = c-0.01;
    if(a<b&&a<c){
        return -1;
    }
    if(b<c){
        return 0;
    }
    return 1;
}

int main() {
    int n;
    cin >> n;

    double a[n][3];
    char c[n];
    rep(i,n){
        cin >> a[i][0] >> a[i][1] >> c[i];
        if(c[i]=='U')a[i][2] = 1;
        if(c[i]=='R')a[i][2] = 2;
        if(c[i]=='D')a[i][2] = 3;
        if(c[i]=='L')a[i][2] = 4;
    }
    double inf = 999999999999;
    double uyma = -inf;
    double uymi = inf;
    double dyma = -inf;
    double dymi = inf;
    double udxma = -inf;
    double udxmi = inf;

    double rxma = -inf;
    double rxmi = inf;
    double lxma = -inf;
    double lxmi = inf;
    double rlyma = -inf;
    double rlymi = inf;

    rep(i,n){
        if(a[i][2]==1){
            maxs(uyma,a[i][1]);
            mins(uymi,a[i][1]);
            maxs(udxma,a[i][0]);
            mins(udxmi,a[i][0]);
        }
        if(a[i][2]==3){
            maxs(dyma,a[i][1]);
            mins(dymi,a[i][1]);
            maxs(udxma,a[i][0]);
            mins(udxmi,a[i][0]);
        }
        if(a[i][2]==2){
            maxs(rxma,a[i][0]);
            mins(rxmi,a[i][0]);
            maxs(rlyma,a[i][1]);
            mins(rlymi,a[i][1]);
        }
        if(a[i][2]==4){
            maxs(lxma,a[i][0]);
            mins(lxmi,a[i][0]);
            maxs(rlyma,a[i][1]);
            mins(rlymi,a[i][1]);
        }
    }

    double ans = (max(max(uyma,dyma),rlyma)-min(min(uymi,dymi),rlymi)) * (max(max(rxma,lxma),udxma)-min(min(rxmi,lxmi),udxmi));

    double time[1000] = {};

    int t = 0;
    
    if(uyma<dyma){
        time[t] = (dyma-uyma)/2;
        t++;
    }
    if(uyma<rlyma){
        time[t] = (rlyma-uyma);
        t++;
    }
    if(rlyma<dyma){
        time[t] = dyma-rlyma;
        t++;
    }
    if(uymi<dymi){
        time[t] = (dymi-uymi)/2;
        t++;
    }
    if(rlymi<dymi){
        time[t] = dymi-rlymi;
        t++;
    }
    if(uymi<rlymi){
        time[t] = rlymi-uymi;
        t++;
    }

    if(rxma<lxma){
        time[t] = (lxma-rxma)/2;
        t++;
    }
    if(rxma<udxma){
        time[t] = (udxma-rxma);
        t++;
    }
    if(udxma<lxma){
        time[t] = lxma-udxma;
        t++;
    }
    if(rxmi<lxmi){
        time[t] = (lxmi-rxmi)/2;
        t++;
    }
    if(udxmi<lxmi){
        time[t] = lxmi-udxmi;
        t++;
    }
    if(rxmi<udxmi){
        time[t] = udxmi-rxmi;
        t++;
    }

    time[t] = 0;
    t++;
    time[t] = 9999999999;
    t++;

    sort(time,time+t);

    rep(i,t-1){
        int xx = 0;
        int yy = 0;
        yy += biggest(uyma+time[i],rlyma,dyma-time[i]);
        yy += smallest(uymi+time[i],rlymi,dymi-time[i]);
        xx += biggest(rxma+time[i],udxma,lxma-time[i]);
        xx += smallest(rxmi+time[i],udxmi,lxmi-time[i]);
        mins(ans,(max(max(uyma+time[i],dyma-time[i]),rlyma)-min(min(uymi+time[i],dymi-time[i]),rlymi)) * (max(max(rxma+time[i],lxma-time[i]),udxma)-min(min(rxmi+time[i],lxmi-time[i]),udxmi)));
        
    }

    

    cout << fixed << setprecision(10) << ans << endl;
    return 0;
}
 
 


Measured memory_bytes: 2688