#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;

#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }


const long long INF = 1LL<<60;
int N;
vector<long long> x, y;
vector<char> d;

pair<double, double> len(double t) {
    double xmi = INF, xma = -INF, ymi = INF, yma = -INF;
    for (int i = 0; i < N; ++i) {
        double cx, cy;
        if (d[i] == 'L') cx = x[i] - t, cy = y[i];
        else if (d[i] == 'R') cx = x[i] + t, cy = y[i];
        else if (d[i] == 'U') cx = x[i], cy = y[i] + t;
        else cx = x[i], cy = y[i] - t;

        chmin(xmi, cx);
        chmax(xma, cx);
        chmin(ymi, cy);
        chmax(yma, cy);
    }
    return {xma - xmi, yma - ymi};
}

double calc(long long s, long long t) {
    double T = t - s;
    double sx = len(s).first;
    double tx = len(t).first;
    double sy = len(s).second;
    double ty = len(t).second;

    double dx = (tx - sx) / T;
    double dy = (ty - sy) / T;

    double res = min(sx * sy, tx * ty);
    double at = 0.0;
    if (abs(dx) > 0.1 && abs(dy) > 0.1) {
        at = -(sx * dy + sy * dx) / (dx * dy * 2);
        if (s <= at && at <= t) {
            chmin(res, len(at).first * len(at).second);
        }
    }

    //cout << s << ", " << t << ": " << make_pair(sx, sy) << ", " << make_pair(tx, ty) << ", " << dx << ", " << dy << ": " << at << ":: " << res << endl;
    return res;
}

double solve() {
    vector<long long> alt;
    alt.push_back(0);

    // 左
    {
        long long mi1 = INF; // L
        long long mi2 = INF; // R
        long long mi3 = INF; // UD
        for (int i = 0; i < N; ++i) {
            if (d[i] == 'L') chmin(mi1, x[i]);
            else if (d[i] == 'R') chmin(mi2, x[i]);
            else chmin(mi3, x[i]);
        }
        //COUT(mi1); COUT(mi3);
        if (mi1 < INF && mi2 < INF) alt.push_back( abs(mi1 - mi2) / 2 );
        if (mi1 < INF && mi3 < INF) alt.push_back( abs(mi1 - mi3) );
        if (mi2 < INF && mi3 < INF) alt.push_back( abs(mi2 - mi3) );
    }
    
    // 右
    {
        long long ma1 = -INF; // L
        long long ma2 = -INF; // R
        long long ma3 = -INF; // UD
        for (int i = 0; i < N; ++i) {
            if (d[i] == 'L') chmax(ma1, x[i]);
            else if (d[i] == 'R') chmax(ma2, x[i]);
            else chmax(ma3, x[i]);
        }
        if (ma1 > -INF && ma2 > -INF) alt.push_back( abs(ma1 - ma2) / 2 );
        if (ma1 > -INF && ma3 > -INF) alt.push_back( abs(ma1 - ma3) );
        if (ma2 > -INF && ma3 > -INF) alt.push_back( abs(ma2 - ma3) );
    }
    
    // 下
    {
        long long mi1 = INF; // D
        long long mi2 = INF; // U
        long long mi3 = INF; // 
        for (int i = 0; i < N; ++i) {
            if (d[i] == 'D') chmin(mi1, y[i]);
            else if (d[i] == 'U') chmin(mi2, y[i]);
            else chmin(mi3, y[i]);
        }
        if (mi1 < INF && mi2 < INF) alt.push_back( abs(mi1 - mi2) / 2 );
        if (mi1 < INF && mi3 < INF) alt.push_back( abs(mi1 - mi3) );
        if (mi2 < INF && mi3 < INF) alt.push_back( abs(mi2 - mi3) );
    }
    // 上
    {
        long long ma1 = -INF; // U
        long long ma2 = -INF; // D
        long long ma3 = -INF; // 
        for (int i = 0; i < N; ++i) {
            if (d[i] == 'D') chmax(ma1, y[i]);
            else if (d[i] == 'U') chmax(ma2, y[i]);
            else chmax(ma3, y[i]);
        }
        if (ma1 > -INF && ma2 > -INF) alt.push_back( abs(ma1 - ma2) / 2 );
        if (ma1 > -INF && ma3 > -INF) alt.push_back( abs(ma1 - ma3) );
        if (ma2 > -INF && ma3 > -INF) alt.push_back( abs(ma2 - ma3) );
    }

    sort(alt.begin(), alt.end());
    alt.erase(unique(alt.begin(), alt.end()), alt.end());
    alt.push_back(1LL<<35);
    
    //COUT(alt);
    double res = INF;
    for (int i = 0; i + 1 < alt.size(); ++i) {
        double tmp = calc(alt[i], alt[i+1]);
        chmin(res, tmp);
    }
    
    return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    while (cin >> N) {
        x.resize(N), y.resize(N), d.resize(N);
        for (int i = 0; i < N; ++i) {
            cin >> x[i] >> y[i] >> d[i];
            x[i] *= 2, y[i] *= 2;
        }
        double res = solve() / 4;
        cout << fixed << setprecision(10) << res << endl;
    }
}














Measured memory_bytes: 1920