#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> make_v(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
    int N;
    cin >> N;
    string S;
    map<char,int> mp;
    mp['R'] = 0;
    mp['L'] = 1;
    mp['U'] = 2;
    mp['D'] = 3;
    vector<double> x(N),y(N);
    auto cx = make_v(4,2,0.);
    auto cy = make_v(4,2,0.);
    for(int i = 0; i < 4; ++i) cx[i][0] = cy[i][0] = -1e10;
    for(int i = 0; i < 4; ++i) cx[i][1] = cy[i][1] =  1e10;

    for(int i = 0; i < N; ++i) {
        char c;
        cin >> x[i] >> y[i] >> c;
        S.push_back(c);
        chmax(cx[mp[c]][0],x[i]);
        chmin(cx[mp[c]][1],x[i]);
        chmax(cy[mp[c]][0],y[i]);
        chmin(cy[mp[c]][1],y[i]);
    }
    set<double> st;
    st.insert(0.);
    for(int i = 0; i < 4; ++i) {
        for(int j = 0; j < 4; ++j) {
            for(int k = 0; k < 2; ++k) {
                st.insert(abs(cx[i][k]+cx[j][k]));
                st.insert(abs(cx[i][k]-cx[j][k]));
                st.insert(abs(cx[i][k]+cx[j][k])/2.);
                st.insert(abs(cx[i][k]-cx[j][k])/2.);
                st.insert(abs(cy[i][k]+cy[j][k]));
                st.insert(abs(cy[i][k]-cy[j][k]));
                st.insert(abs(cy[i][k]+cy[j][k])/2.);
                st.insert(abs(cy[i][k]-cy[j][k])/2.);
            }
        }
    }

    double ans = 1e17;
    for(auto t: st) {
        double xMax = -1e15,xMin = 1e15,yMax = -1e15, yMin = 1e15;
        for(int i = 0; i < N; ++i) {
            double u=x[i],v=y[i];
            if(S[i]=='R') u+=t;
            if(S[i]=='L') u-=t;
            if(S[i]=='U') v+=t;
            if(S[i]=='D') v-=t;
            chmax(xMax,u);
            chmin(xMin,u);
            chmax(yMax,v);
            chmin(yMin,v);
        }
        chmin(ans,(xMax-xMin)*(yMax-yMin));
    }
    printf("%.10f\n",ans);
	return 0;
}


Measured memory_bytes: 2048