#include<bits/stdc++.h>
//using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i,j,n) for(ll i=(ll)(j);i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(ll)(j);i<=(ll)(n);i++)
#define per(i,j,n) for(ll i=(ll)(j);(ll)(n)<=i;i--)
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(ll)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(ll)(key)))
#define pb emplace_back
#define mp std::make_pair
//
#define endl "\n"
//using std::endl;
using std::cin;
using std::cout;
using std::vector;
using std::string;
using std::upper_bound;
using std::lower_bound;
using vi=vector<ll>;
using vii=vector<vi>;
using pii=std::pair<ll,ll>;
//
constexpr ll MOD=1e9+7;
//constexpr ll MOD=998244353;
//constexpr ll MOD=10000000;
//constexpr ll MOD=1e5;
constexpr ll MAX=1e6;
constexpr ll INF=(1ll<<60);
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template<typename T>
struct Segment_tree{
    ll N;
    T mem;
    vector<T> node;
    Segment_tree(vector<T> &X,T m):mem(m){
        ll sz=X.size();
        N=1;
        while(N<sz) N*=2;
        node.resize(2*N-1,mem);
        rep(i,0,sz) node[N-1+i]=X[i];
        per(i,N-2,0){
            node[i]=Compare(node[i*2+1],node[i*2+2]);
        }
    }
    T Compare(T &A,T &B){
        return std::min(A,B);
    }
    void update(ll X,T val){
        X+=N-1;
        node[X]=val;
        while(X>0){
            X=(X-1)/2;
            node[X]=Compare(node[X*2+1],node[X*2+2]);
        }
    }
    T Query(ll a,ll b,ll now,ll l,ll r){ //[a,b),[l,r)
        if(r<0) r=N;
        if(r<=a||b<=l) return mem;
        if(a<=l&&r<=b) return node[now];
        auto vl=Query(a,b,now*2+1,l,(l+r)/2),vr=Query(a,b,now*2+2,(l+r)/2,r);
        return Compare(vl,vr);
    }
};
struct Binary_indexed_tree{
    int N;
    vi bit;
    Binary_indexed_tree(int n):N(n){
        bit.resize(N+1,0);
    }
    void add(int x,int a){
        for(x;x<=N;x+=(x&-x)) bit[x]+=a;
    }
    ll sum(int x){
        ll ret=0;
        for(x;x>0;x-=(x&-x)) ret+=bit[x];
        return ret;
    }
    ll lower_bound(ll X){
        if(sum(N)<X) return -1;
        ll ret=0,memo=1,sum=0;
        while(memo*2<=N) memo*=2;
        while(memo>0){
            if(memo+ret<=N&&sum+bit[memo+ret]<X){
                sum+=bit[memo+ret];
                ret+=memo;
            }
            memo/=2;
        }
        return ret+1;
    }
};
struct Union_Find{
    ll N;
    vi par;
    vi siz;
    Union_Find(int n):N(n){
        par.resize(N);
        siz.resize(N,1);
        rep(i,0,N) par[i]=i;
    }
    ll root(ll X){
        if(par[X]==X) return X;
        return par[X]=root(par[X]);
    }
    bool same(ll X,ll Y){
        return root(X)==root(Y);
    }
    void unite(ll X,ll Y){
        X=root(X);
        Y=root(Y);
        if(X==Y) return;
        par[X]=Y;
        siz[Y]+=siz[X];
        siz[X]=0;
    }
    ll size(ll X){
        return siz[root(X)];
    }
};
long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}
vi fac,finv,inv;
void COMinit() {
    fac.resize(MAX);
    finv.resize(MAX);
    inv.resize(MAX);
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; 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 COM(ll n,ll r){
    if(n<r||n<0||r<0) return 0;
    return fac[n]*finv[r]%MOD*finv[n-r]%MOD;
}
int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll N; cin>>N;
    vector<std::set<ll>> x(4),y(4);
    vi P={1,0,-1,0},Q={0,1,0,-1};//R,U,L,D
    rep(i,0,N){
        ll X,Y; cin>>X>>Y;
        char Z; cin>>Z;
        ll memo;
        if(Z=='R') memo=0;
        if(Z=='U') memo=1;
        if(Z=='L') memo=2;
        if(Z=='D') memo=3;
        x[memo].insert(X);
        y[memo].insert(Y);
    }
    vi xmax(4,INF),xmin(4,INF),ymax(4,INF),ymin(4,INF);
    rep(i,0,4){
        if(!x[i].empty()){
            xmax[i]=*rbegin(x[i]);
            xmin[i]=*begin(x[i]);
        }
        if(!y[i].empty()){
            ymax[i]=*rbegin(y[i]);
            ymin[i]=*begin(y[i]);
        }
    }
    double ans=4e16;
    rep(i,0,4){
        if(xmax[i]==INF) continue;
        rep(j,0,4){
            if(xmin[j]==INF) continue;
            rep(k,0,4){
                if(ymax[k]==INF) continue;
                rep(l,0,4){
                    if(ymin[l]==INF) continue;
                    double left=0,right=1e8;
                    rep(_,0,1000){
                        if(left>right) goto XYZ;
                        double x=(right-left)/3.0;
                        double y=right-x;
                        x+=left;
                        bool flag=1;
                        rep(a,0,4){
                            if(a!=i&&xmax[a]!=INF){
                                double p=xmax[i]+P[i]*x,q=xmax[a]+P[a]*x;
                                if(p<q){
                                    flag=0;
                                    if(P[a]==-1) left=x;
                                    else right=x;
                                }
                            }
                            if(left>right) goto XYZ;
                            if(a!=i&&xmax[a]!=INF){
                                double p=xmax[i]+P[i]*y,q=xmax[a]+P[a]*y;
                                if(p<q){
                                    flag=0;
                                    if(P[a]==-1) left=y;
                                    else right=y;
                                }
                            }
                            if(left>right) goto XYZ;
                        }
                        rep(a,0,4){
                            if(a!=k&&ymax[a]!=INF){
                                double p=ymax[k]+Q[k]*x,q=ymax[a]+Q[a]*x;
                                if(p<q){
                                    flag=0;
                                    if(Q[a]==-1) left=x;
                                    else right=x;
                                }
                            }
                            if(left>right) goto XYZ;
                            if(a!=k&&ymax[a]!=INF){
                                double p=ymax[k]+Q[k]*y,q=ymax[a]+Q[a]*y;
                                if(p<q){
                                    flag=0;
                                    if(Q[a]==-1) left=y;
                                    else right=y;
                                }
                            }
                            if(left>right) goto XYZ;
                        }
                        rep(a,0,4){
                            if(a!=j&&xmin[a]!=INF){
                                double p=xmin[j]+P[j]*x,q=xmin[a]+P[a]*x;
                                if(p>q){
                                    flag=0;
                                    if(P[a]==1) left=x;
                                    else right=x;
                                }
                            }
                            if(left>right) goto XYZ;
                            if(a!=j&&xmin[a]!=INF){
                                double p=xmin[j]+P[j]*y,q=xmin[a]+P[a]*y;
                                if(p>q){
                                    flag=0;
                                    if(P[a]==1) left=y;
                                    else right=y;
                                }
                            }
                            if(left>right) goto XYZ;
                        }
                        rep(a,0,4){
                            if(a!=l&&ymin[a]!=INF){
                                double p=ymin[l]+Q[l]*x,q=ymin[a]+Q[a]*x;
                                if(p>q){
                                    flag=0;
                                    if(Q[a]==1) left=x;
                                    else right=x;
                                }
                            }
                            if(left>right) goto XYZ;
                            if(a!=l&&ymin[a]!=INF){
                                double p=ymin[l]+Q[l]*y,q=ymin[a]+Q[a]*y;
                                if(p>q){
                                    flag=0;
                                    if(Q[a]==1) left=y;
                                    else right=y;
                                }
                            }
                            if(left>right) goto XYZ;
                        }
                        if(flag){
                            double a=xmax[i]+P[i]*x,b=xmin[j]+P[j]*x,c=ymax[k]+Q[k]*x,d=ymin[l]+Q[l]*x;
                            double A=xmax[i]+P[i]*y,B=xmin[j]+P[j]*y,C=ymax[k]+Q[k]*y,D=ymin[l]+Q[l]*y;
                            if(a<b||c<d){
                                right=x;
                                continue;
                            }
                            if(A<B||C<D){
                                right=y;
                                continue;
                            }
                            double X=(a-b)*(c-d),Y=(A-B)*(C-D);
                            if(X<Y){
                                right=y;
                                ans=std::min(ans,X);
                            }
                            else{
                                left=x;
                                ans=std::min(ans,Y);
                            }
                        }
                    }
                    XYZ:;
                }
            }
        }
    }
    printf("%.10lf\n",ans);
}


Measured memory_bytes: 12556