#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<Double,Double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

#define PQ(T) priority_queue<T>
#define RPQ(T) priority_queue<T,vector<T>,greater<T>>

template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }
template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }


const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

Double solve(int N, vi& x, vi& y, vector<char>& d) {
    vi down_y, up_y, left_x, right_x;
    vi updown_x, leftright_y;
    rep(i,N){
        switch(d[i]){
            case 'U':
                up_y.pb(y[i]);
                updown_x.pb(x[i]);
                break;
            case 'D':
                down_y.pb(y[i]);
                updown_x.pb(x[i]);
                break;
            case 'R':
                right_x.pb(x[i]);
                leftright_y.pb(y[i]);
                break;
            case 'L':
                left_x.pb(x[i]);
                leftright_y.pb(y[i]);
                break;
        }
    }

    sort(ALL(up_y));
    sort(ALL(leftright_y));
    sort(ALL(down_y));

    sort(ALL(right_x));
    sort(ALL(updown_x));
    sort(ALL(left_x));

    if (up_y.size() > 2) {
        up_y = { up_y[0], up_y.back() };
    }
    if (leftright_y.size() > 2) {
        leftright_y = { leftright_y[0], leftright_y.back() };
    }
    if (down_y.size() > 2) {
        down_y = { down_y[0], down_y.back() };
    }

    if (right_x.size() > 2) {
        right_x = { right_x[0], right_x.back() };
    }
    if (updown_x.size() > 2) {
        updown_x = { updown_x[0], updown_x.back() };
    }
    if (left_x.size() > 2) {
        left_x = { left_x[0], left_x.back() };
    }

    set<Double> ts;
    for (int y0: up_y) {
        for (int yi : leftright_y) {
            Double t = yi - y0;
            if (t >= 0) ts.insert(t);
        }
        for (int yd: down_y) {
            Double t = 0.5 * (yd - y0);
            if (t >= 0) ts.insert(t);
        }
    }
    for (int yd: down_y) {
        for (int yi : leftright_y) {
            Double t = yd - yi;
            if (t >= 0) ts.insert(t);
        }
    }

    for (int x0: right_x) {
        for (int xi : updown_x) {
            Double t = xi - x0;
            if (t >= 0) ts.insert(t);
        }
        for (int xd: left_x) {
            Double t = 0.5 * (xd - x0);
            if (t >= 0) ts.insert(t);
        }
    }
    for (int xd: left_x) {
        for (int xi : updown_x) {
            Double t = xd - xi;
            if (t >= 0) ts.insert(t);
        }
    }

    Double tmax = 1e10;

    ts.insert(0);
    ts.insert(tmax);
    vector<Double> td(ALL(ts));
    int T = td.size();


    auto f = [&](Double t) -> Double {
        #define inf (tmax*2)
        Double xmax = -inf, xmin = inf;
        for (int x0: right_x) {
            amax(xmax, x0 + t);
            amin(xmin, x0 + t);
        }
        for (int xi: updown_x) {
            amax(xmax, (Double)xi);
            amin(xmin, (Double)xi);
        }
        for (int x0: left_x) {
            amax(xmax, x0 - t);
            amin(xmin, x0 - t);
        }
        Double ymax = -inf, ymin = inf;
        for (int y0: up_y) {
            amax(ymax, y0 + t);
            amin(ymin, y0 + t);
        }
        for (int yi: leftright_y) {
            amax(ymax, (Double)yi);
            amin(ymin, (Double)yi);
        }
        for (int y0: down_y) {
            amax(ymax, y0 - t);
            amin(ymin, y0 - t);
        }
        Double dx = xmax - xmin, dy = ymax - ymin;
        return dx * dy;
    };

    Double best = f(0);
    for (Double t: td) {
        amin(best, f(t));
    }

    for (int i=0; i<T-1; ++i) {
        Double t0 = td[i], t1 = td[i+1];
        Double lo = t0, hi = t1;
        rep(z, 3000) {
            Double p1 = (lo*2 + hi)/3, p2 = (lo + hi*2)/3;
            Double f1 = f(p1), f2 = f(p2);
            if (f1 < f2) {
                hi = p2;
            } else {
                lo = p1;
            }
        }
        Double t = (lo+hi) / 2;
        Double ft = f(t);
        best = min(best, ft);
    }
    return best;
}

int main() {
    int N; scanf("%d%*c", &N);
    vi x(N), y(N);
    vector<char> d(N);
    rep(i,N) scanf("%d %d %c%*c", &x[i], &y[i], &d[i]);
    Double ans = solve(N,x,y,d);
    printf("%.12Lf\n", ans);
    return 0;
}


Measured memory_bytes: 2172