#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template<typename T, typename U> T pow_(T a, U b) { return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { rep(i, sz(vec)) { if (i) os << " "; os << vec[i]; } return os; }
template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T, class T2> inline void add(T &a, T2 b) { a += b % mod; if (a >= mod) a -= mod; }
template<class T> void operator += (vector<T>& v, vector<T> v2) { rep(i, sz(v2)) v.eb(v2[i]); }

void solve();

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(12); // debuged
    int T;
    T = 1;
    while (T--) solve();
}

// https://atcoder.jp/contests/abc130/submissions/15524638
void solve() {
    int n;
    cin >> n;
    double xfl = inf, xfr = -inf, xll = inf, xlr = -inf, xrl = inf, xrr = -inf;
    double yfd = inf, yfu = -inf, ydd = inf, ydu = -inf, yud = inf, yuu = -inf;
    
    rep(i, n) {
        double x, y; char d;
        cin >> x >> y >> d;
        if (d == 'U') {
            chmin(yud, y);
            chmax(yuu, y);
            
            chmin(xfl, x);
            chmax(xfr, x);
        } else if (d == 'D') {
            chmin(ydd, y);
            chmax(ydu, y);
            
            chmin(xfl, x);
            chmax(xfr, x);
        } else if (d == 'L') {
            chmin(xll, x);
            chmax(xlr, x);
            
            chmin(yfd, y);
            chmax(yfu, y);
        } else {
            chmin(xrl, x);
            chmax(xrr, x);
            
            chmin(yfd, y);
            chmax(yfu, y);
        }
    }
    
    vector<double> t;
    t.eb(0); // debuged
    
    t.eb(abs(xfl - xll));
    t.eb(abs(xfl - xlr));
    t.eb(abs(xfl - xrl));
    t.eb(abs(xfl - xrr));
    
    t.eb(abs(xfr - xll));
    t.eb(abs(xfr - xlr));
    t.eb(abs(xfr - xrl));
    t.eb(abs(xfr - xrr));
    
    t.eb(abs(xll - xrl) / 2);
    t.eb(abs(xll - xrr) / 2);
    t.eb(abs(xlr - xrl) / 2);
    t.eb(abs(xlr - xrr) / 2);
    
    t.eb(abs(yfd - ydd));
    t.eb(abs(yfd - ydu));
    t.eb(abs(yfd - yud));
    t.eb(abs(yfd - yuu));
    
    t.eb(abs(yfu - ydd));
    t.eb(abs(yfu - ydu));
    t.eb(abs(yfu - yud));
    t.eb(abs(yfu - yuu));
    
    t.eb(abs(ydd - yud) / 2);
    t.eb(abs(ydd - yuu) / 2);
    t.eb(abs(ydu - yud) / 2);
    t.eb(abs(ydu - yuu) / 2);
    
    double ans = INF;
    for (double ti : t) {
        chmin(ans, (max({xfr, xlr - ti, xrr + ti}) - min({xfl, xll - ti, xrl + ti})) * (max({yfu, yuu + ti, ydu - ti}) - min({yfd, ydd - ti, yud + ti})));
    }
    cout << ans << endl;
}



Measured memory_bytes: 3840