#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod

double check(vector<double> &x, vector<double> &y, vector<char> &d, double t){
    double xmax = -INF, xmin = INF, ymax = -INF, ymin = INF;
    int N = SZ(x);
    REP(i, N){
        double x0 = x[i], y0 = y[i];
        if(d[i] == 'R') x0 += t;
        if(d[i] == 'L') x0 -= t;
        if(d[i] == 'U') y0 += t;
        if(d[i] == 'D') y0 -= t;
        Max(xmax, x0);
        Min(xmin, x0);
        Max(ymax, y0);
        Min(ymin, y0);
    }
    return (xmax - xmin) * (ymax - ymin);
}

signed main(){

    int N; cin >> N;
    vector<double> x(N), y(N);
    vector<char> d(N);

    REP(i, N){
        cin >> x[i] >> y[i] >> d[i];
    }
    double ans = check(x, y, d, 0.0);

    double xpmax = -INF, xmmax = -INF, x0max = -INF;
    double xpmin = INF, xmmin = INF, x0min = INF;
    REP(i, N){
        if(d[i] == 'R'){
            Max(xpmax, x[i]);
            Min(xpmin, x[i]);
        }else if(d[i] == 'L'){
            Max(xmmax, x[i]);
            Min(xmmin, x[i]);
        }else{
            Max(x0max, x[i]);
            Min(x0min, x[i]);
        }
    }
    if(xpmax > -INF && xmmax > -INF && xpmax < xmmax){
        double t = (xmmax - xpmax) / 2.0;
        Min(ans, check(x, y, d, t));
    }
    if(xpmax > -INF && x0max > -INF && xpmax < x0max){
        double t = x0max - xpmax;
        Min(ans, check(x, y, d, t));
    }
    if(xmmax > -INF && x0max > -INF && x0max < xmmax){
        double t = xmmax - x0max;
        Min(ans, check(x, y, d, t));
    }
    if(xpmin < INF && xmmin < INF && xpmin < xmmin){
        double t = (xmmin - xpmin) / 2.0;
        Min(ans, check(x, y, d, t));
    }
    if(xpmin < INF && x0min < INF && xpmin < x0min){
        double t = x0min - xpmin;
        Min(ans, check(x, y, d, t));
    }
    if(xmmin < INF && x0min < INF && x0min < xmmin){
        double t = xmmin - x0min;
        Min(ans, check(x, y, d, t));
    }

    double ypmax = -INF, ymmax = -INF, y0max = -INF;
    double ypmin = INF, ymmin = INF, y0min = INF;
    REP(i, N){
        if(d[i] == 'U'){
            Max(ypmax, y[i]);
            Min(ypmin, y[i]);
        }else if(d[i] == 'D'){
            Max(ymmax, y[i]);
            Min(ymmin, y[i]);
        }else{
            Max(y0max, y[i]);
            Min(y0min, y[i]);
        }
    }
    if(ypmax > -INF && ymmax > -INF && ypmax < ymmax){
        double t = (ymmax - ypmax) / 2.0;
        Min(ans, check(x, y, d, t));
    }
    if(ypmax > -INF && y0max > -INF && ypmax < y0max){
        double t = y0max - ypmax;
        Min(ans, check(x, y, d, t));
    }
    if(ymmax > -INF && y0max > -INF && y0max < ymmax){
        double t = ymmax - y0max;
        Min(ans, check(x, y, d, t));
    }
    if(ypmin < INF && ymmin < INF && ypmin < ymmin){
        double t = (ymmin - ypmin) / 2.0;
        Min(ans, check(x, y, d, t));
    }
    if(ypmin < INF && y0min < INF && ypmin < y0min){
        double t = y0min - ypmin;
        Min(ans, check(x, y, d, t));
    }
    if(ymmin < INF && y0min < INF && y0min < ymmin){
        double t = ymmin - y0min;
        Min(ans, check(x, y, d, t));
    }

    Out(ans);

    return 0;
}


Measured memory_bytes: 1920