#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define double long double
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORR(i, a, b) for(int i = (a); i > (b); --i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) __builtin_clzll(x)
#define SZ(x) ((long long)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define PERM(c)                                                                \
    sort(All(c));                                                              \
    for(bool cp = true; cp; cp = next_permutation(All(c)))
#define MKORDER(n)                                                             \
    vector<int> od(n);                                                         \
    iota(All(od), 0LL);

template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
#define CCIN(...)                                                              \
    char __VA_ARGS__;                                                          \
    CIN(__VA_ARGS__)
#define DCIN(...)                                                              \
    double __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    long long __VA_ARGS__;                                                     \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v)                                                              \
    {                                                                          \
        FOREACH(x, v) { cout << x << " "; }                                    \
        cout << "\n";                                                          \
    }
template <typename T = string> inline void eputs(T s) {
    cout << s << "\n";
    exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}

template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;

typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;

const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18;
const double PI = atan(1.0) * 4.0;
const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238

signed main() {
    LCIN(N);
    VD x(N), y(N);
    double rr = -INF, rl = INF, mu = -INF, md = INF;
    double mr = -INF, ml = INF, uu = -INF, ud = INF;
    double lr = -INF, ll = INF;
    double du = -INF, dd = INF;
    REP(i, N) {
        cin >> x[i] >> y[i];
        SCIN(d);
        if(d == "R") {
            rr = max(rr, x[i]);
            rl = min(rl, x[i]);
            mu = max(mu, y[i]);
            md = min(md, y[i]);
        } else if(d == "U") {
            mr = max(mr, x[i]);
            ml = min(ml, x[i]);
            uu = max(uu, y[i]);
            ud = min(ud, y[i]);
        } else if(d == "L") {
            lr = max(lr, x[i]);
            ll = min(ll, x[i]);
            mu = max(mu, y[i]);
            md = min(md, y[i]);
        } else {
            mr = max(mr, x[i]);
            ml = min(ml, x[i]);
            du = max(du, y[i]);
            dd = min(dd, y[i]);
        }
    }
    auto f = [=](double t) {
        double xmi = INF, xma = -INF, ymi = INF, yma = -INF;
        xmi = min({ml, ll - t, rl + t});
        xma = max({mr, lr - t, rr + t});
        ymi = min({md, dd - t, ud + t});
        yma = max({mu, du - t, uu + t});
        return (xma - xmi) * (yma - ymi);
    };
    double lb = 0, ub = INF;
    REP(loop, 200) {
        double ml = (2 * lb + ub) / 3, mr = (lb + 2 * ub) / 3;
        if(f(ml) < f(mr))
            ub = mr;
        else
            lb = ml;
    }
    cout << setprecision(12) << f(lb) << "\n";
}


Measured memory_bytes: 1920