#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int,int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
template<class T>bool chmax(T &a, const T &b) {if(a<b){a = b; return 1;} return 0; };
template<class T>bool chmin(T &a, const T &b) {if(a>b){a = b; return 1;} return 0; };
inline void IN(void){return;}
template <typename First, typename... Rest> void IN(First& first, Rest&... rest){cin >> first;IN(rest...);return;}
inline void OUT(void){cout << "\n";return;}
template <typename First, typename... Rest> void OUT(First first, Rest... rest){cout << first << " ";OUT(rest...);return;}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
const int INF = 1e9;
const long long LLINF = 1e18;
long long lcm(ll a, ll b){return a * b / __gcd(a,b);}
struct IoSetup { IoSetup() {
    cin.tie(nullptr);ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
} } iosetup;
template< int mod > struct ModInt {
    int x; ModInt() : x(0) {}
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}
    ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}
    ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}
    ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); }return ModInt(u);}
    ModInt pow(int64_t n) const {ModInt ret(1), mul(x); while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}
    friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x;}
    friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); }
    static int get_mod() { return mod; }
}; using modint = ModInt< mod >;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

const double inf = 1e10;

struct D {
    vector<double> l, r;
    D():l(3, inf), r(3, -inf){}
    void add(double x, int v){
        ++v;
        chmin(l[v], x);
        chmax(r[v], x);
    }
    double get(double t){
        double nl = inf, nr = -inf;
        rep(i, 0, 3){
            chmin(nl, l[i]+i*t);
            chmax(nr, r[i]+i*t);
        }
        return nr - nl;
    }
    vector<double> events(){
        vector<double> ts;
        rep(i, 0, 3) rep(j, 0, i){ // j < i
            {
                double t = (l[j] - l[i]) / (i - j);
                if(t > 0) ts.push_back(t);
            }
            {
                double t = (r[j] - r[i]) / (i - j);
                if(t > 0) ts.push_back(t);
            }
        }
        return ts;
    }
};

int main(){
    iosetup;
    int n; cin >> n;
    D xd, yd;
    rep(i, 0, n){
        int x, y;
        char d;
        cin >> x >> y >> d;
        if( d == 'L') xd.add(x, -1), yd.add(y, 0);
        if( d == 'R') xd.add(x, 1), yd.add(y, 0);
        if( d == 'U') xd.add(x, 0), yd.add(y, 1);
        if( d == 'D') xd.add(x, 0), yd.add(y, -1);
    }
    vector<double> ts;
    ts.push_back(0);
    ts.push_back(inf);
    {
        auto nts = xd.events();
        ts.insert(ts.end(), ALL(nts));
    }
    {
        auto nts = yd.events();
        ts.insert(ts.end(), ALL(nts));
    }
    sort(ALL(ts));
    double ans = 1e18;
    for(double t: ts){
        double now = xd.get(t) * yd.get(t);
        chmin(ans, now);
    }
    cout << ans << endl;

    return 0;
}

Measured memory_bytes: 256