#include <bits/stdc++.h>
#define ll long long
#define INF (1LL << 60)
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define int __int128

using namespace std;

using LL = __int128;
istream& operator>>(istream& is, LL& v)
{
    string s;
    is >> s;
    v = 0;
    for (int i = 0; i < (int)s.size(); i++) {
        if (isdigit(s[i])) { v = v * 10 + s[i] - '0'; }
    }
    if (s[0] == '-') { v *= -1; }
    return is;
}

ostream& operator<<(ostream& os, const LL& v)
{
    if (v == 0) { return (os << "0"); }
    LL num = v;
    if (v < 0) {
        os << '-';
        num = -num;
    }
    string s;
    for (; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }
    reverse(s.begin(), s.end());
    return (os << s);
}

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}};
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef TRI<int, int, char> tri;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;

const int MAX_N = 100005;

vector<tri> vec;
int n;

vector<int> solve(){
    // int mnx1 = INF, mny1 = INF, mnz1 = INF;
    // int mnx2 = -INF, mny2 = -INF, mnz2 = -INF;
    // int x1 = -1, y1 = -1, z1 = -1;
    // int x2 = -1, y2 = -1, z2 = -1;
    int mn = INF, mx = -INF;
    vi ans;
    rep(i,n){
        cmn(mn, vec[i].fi), cmx(mx, vec[i].fi);
    }
    int flag = 0;
    rep(i,n){
        if(mn == vec[i].fi){
            if(vec[i].th == 'L'){
                cmx(flag, (LL)2);
            }else if(vec[i].th == 'U' || vec[i].th == 'D'){
                cmx(flag, (LL)1);
            }
        }
    }
    ans.pb(0);
    if(flag == 0){
        int val1 = INF, val2 = INF;
        rep(i,n){
            if(vec[i].th == 'L'){
                cmn(val1, vec[i].fi);
            }else if(vec[i].th == 'U' || vec[i].th == 'D'){
                cmn(val2, vec[i].fi);
            }
        }
        if(val1 == INF){
            if(val2 != INF){
                ans.pb(val2-mn);
            }
        }else if(val2 == INF){
            ans.pb((val1-mn)/2);
        }else{
            val1 = (val1-mn)/2;
            val2 -= mn;
            if(val1 <= val2){
                ans.pb(val1);
            }else{
                ans.pb(val1), ans.pb(val2);
            }
        }
    }else if(flag == 1){
        int val = INF;
        rep(i,n){
            if(vec[i].th == 'L'){
                cmn(val, vec[i].fi);
            }
        }
        if(val != INF){
            ans.pb(val-mn);
        }
    }
    // 逆向き
    flag = 0;
    rep(i,n){
        if(mx == vec[i].fi){
            if(vec[i].th == 'R'){
                cmx(flag, (LL)2);
            }else if(vec[i].th == 'U' || vec[i].th == 'D'){
                cmx(flag, (LL)1);
            }
        }
    }
    if(flag == 0){
        int val1 = -INF, val2 = -INF;
        rep(i,n){
            if(vec[i].th == 'R'){
                cmx(val1, vec[i].fi);
            }else if(vec[i].th == 'U' || vec[i].th == 'D'){
                cmx(val2, vec[i].fi);
            }
        }
        if(val1 == -INF){
            if(val2 != -INF){
                ans.pb(mx-val2);
            }
        }else if(val2 == -INF){
            ans.pb((mx-val1)/2);
        }else{
            val1 = (mx-val1)/2;
            val2 = mx-val2;
            if(val1 <= val2){
                ans.pb(val1);
            }else{
                ans.pb(val1), ans.pb(val2);
            }
        }
    }else if(flag == 1){
        int val = -INF;
        rep(i,n){
            if(vec[i].th == 'R'){
                cmx(val, vec[i].fi);
            }
        }
        if(val != -INF){
            ans.pb(mx-val);
        }
    }
    return ans;
}

signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n;
    vec.resize(n);
    rep(i,n){
        int a,b;
        char c;
        cin >> a >> b >> c;
        vec[i] = {2*a, 2*b, c};
    }
    set<int> res;
    vi res1 = solve();
    rep(i,n){
        swap(vec[i].fi, vec[i].se);
        if(vec[i].th == 'R'){
            vec[i].th = 'U';
        }else if(vec[i].th == 'L'){
            vec[i].th = 'D';
        }else if(vec[i].th == 'U'){
            vec[i].th = 'R';
        }else{
            vec[i].th = 'L';
        }
    }
    vi res2 = solve();
    each(val,res1){
        res.insert(val);
    }
    each(val,res2){
        res.insert(val);
    }
    // show(res);
    double ans = 1e100;
    each(val,res){
        int mny = INF, mxy = -INF, mnx = INF, mxx = -INF;
        rep(i,n){
            int u = vec[i].fi, v = vec[i].se;
            if(vec[i].th == 'R'){
                u += val;
            }else if(vec[i].th == 'L'){
                u -= val;
            }else if(vec[i].th == 'U'){
                v += val;
            }else{
                v -= val;
            }
            cmn(mnx, u), cmx(mxx, u);
            cmn(mny, v), cmx(mxy, v);
        }
        // ashow(mnx, mny, mxx, mxy);
        cmn(ans, (double)(mxx-mnx)*(mxy-mny)/4.0);
    }
    printf("%.12lf\n", ans);
    return 0;
}


Measured memory_bytes: 4992