#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a) {
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'[';
    for(const T &i: a) out<<i<<',';
    out<<']';
    return out;
}
template<class T>
ostream &operator <<(ostream& out, const set<T>& a) {
    out<<'{';
    for(const T &i: a) out<<i<<',';
    out<<'}';
    return out;
}
template<class T, class S>
ostream &operator <<(ostream& out, const map<T,S>& a) {
    out<<'{';
    for(auto &i: a) out<<i<<',';
    out<<'}';
    return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const double LLINF = 1000000000;
const ll MOD = 1000000007;

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n;
    cin >> n;
    vector<double> x(n), y(n);
    vector<char> d(n);
    REP(i, n) cin >> x[i] >> y[i] >> d[i];

    vector<double> t(1, 0);
    {
        // L, U/D, R
        double a = LLINF, b = LLINF, c = LLINF;
        REP(i, n) {
            if(d[i] == 'L') chmin(a, x[i]);
            else if(d[i] == 'R') chmin(c, x[i]);
            else chmin(b, x[i]);
        }
        t.push_back(abs(a-b));
        t.push_back(abs(a-c)/2.0);
        t.push_back(abs(b-c));
    }
    {
        // L, U/D, R
        double a = -LLINF, b = -LLINF, c = -LLINF;
        REP(i, n) {
            if(d[i] == 'L') chmax(a, x[i]);
            else if(d[i] == 'R') chmax(c, x[i]);
            else chmax(b, x[i]);
        }
        t.push_back(abs(a-b));
        t.push_back(abs(a-c)/2.0);
        t.push_back(abs(b-c));
    }
    {
        // U, L/R, D
        double a = -LLINF, b = -LLINF, c = -LLINF;
        REP(i, n) {
            if(d[i] == 'U') chmax(a, y[i]);
            else if(d[i] == 'D') chmax(c, y[i]);
            else chmax(b, y[i]);
        }
        t.push_back(abs(a-b));
        t.push_back(abs(a-c)/2.0);
        t.push_back(abs(b-c));
    }
    {
        // U, L/R, D
        double a = LLINF, b = LLINF, c = LLINF;
        REP(i, n) {
            if(d[i] == 'U') chmin(a, y[i]);
            else if(d[i] == 'D') chmin(c, y[i]);
            else chmin(b, y[i]);
        }
        t.push_back(abs(a-b));
        t.push_back(abs(a-c)/2.0);
        t.push_back(abs(b-c));
    }

    sort(ALL(t));
    t.erase(unique(ALL(t)), t.end());
    // cout << t << endl;

    double ans = LLINF * LLINF;
    for(auto i: t) {
        // i秒後について
        double xmin = LLINF, xmax = -LLINF, ymin = LLINF, ymax = -LLINF;
        REP(j, n) {
            double nx = x[j], ny = y[j];
            if(d[j]=='L') nx -= i;
            else if(d[j]=='R') nx += i;
            else if(d[j]=='D') ny -= i;
            else if(d[j]=='U') ny += i;
            chmin(xmin, nx), chmin(ymin, ny);
            chmax(xmax, nx), chmax(ymax, ny);
        }
        chmin(ans, (xmax-xmin)*(ymax-ymin));
    }
    cout << fixed << setprecision(9) << ans << endl;

    return 0;
}


Measured memory_bytes: 1920