/**
 * @brief  : c++ code for AtCoder
 * @author : rk222
 * @created: 2019.12.28 20:13:56
 */

#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;

// #define int long long

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<tuple<int, int, int>> vt;

#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i, x) for (int i = 0; i < x; i++)
#define rep1(i, x) for (int i = 1; i <= x; i++)
#define srep(i, s, x) for (int i = s; i < x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rrep1(i, x) for (int i = x; i > 0; i--)
#define rsrep(i, s, x) for (int i = x - 1; i >= s; i--)
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
#define mp1(a, b, c) P1(a, P(b, c))
#define dame                                                                                  \
    {                                                                                         \
        puts("-1");                                                                           \
        return 0;                                                                             \
    }
#define yn                                                                                    \
    puts("Yes");                                                                              \
    else puts("No")
#define YN                                                                                    \
    puts("YES");                                                                              \
    else puts("NO")

template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) {
    return '"' + s + '"';
}
string to_string(const char *s) {
    return to_string((string)s);
}
string to_string(bool b) {
    return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
    bool first = true;
    string ret = "{";
    for (int i = 0; i < static_cast<int>(v.size()); i++) {
        if (!first) {
            ret += ", ";
        }
        first = false;
        ret += to_string(v[i]);
    }
    ret += "}";
    return ret;
}
template <size_t N> string to_string(bitset<N> v) {
    string ret = "";
    for (size_t i = 0; i < N; i++) {
        ret += static_cast<char>('0' + v[i]);
    }
    return ret;
}
template <typename A> string to_string(A v) {
    bool first = true;
    string ret = "{";
    for (const auto &x : v) {
        string s = to_string(x);
        if (!first) {
            ret += ", ";
        }
        if (s[0] == '{') {
            s = "\n" + s;
        }
        first = false;
        ret += s;
    }
    if (ret[ret.size() - 1] == '}') {
        ret += "\n}";
    } else {
        ret += "}";
    }
    return ret;
}
template <typename A, typename... Lest> string to_string(A *v, int n, Lest... L) {
    bool first = true;
    string ret = "{";
    rep(i, n) {
        auto x = v[i];
        string s = to_string(x, L...);
        if (!first) {
            ret += ", ";
        }
        if (s[0] == '{') {
            s = "\n" + s;
        }
        first = false;
        ret += s;
    }
    if (ret[ret.size() - 1] == '}') {
        ret += "\n}";
    } else {
        ret += "}";
    }
    return ret;
}
template <typename A, typename B> string to_string(pair<A, B> p) {
    return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p) {
    return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
           to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
    return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
           to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void name_disp(string s) {
    cerr << "-------" << endl;
    cerr << s << ": " << endl;
}
void val_disp() {
    cerr << endl;
}
template <typename First, typename... Lest> void val_disp(First F, Lest... L) {
    cerr << to_string(F) << endl;
    val_disp(L...);
}
template <typename A, typename... Lest> void val_disp(A *v, Lest... L) {
    cerr << to_string(v, L...) << endl;
    val_disp();
}
#define disp(...)                                                                             \
    name_disp(#__VA_ARGS__);                                                                  \
    val_disp(__VA_ARGS__)
#define adisp(a, ...)                                                                         \
    name_disp(#a);                                                                            \
    val_disp(a, __VA_ARGS__)

#ifdef int
const ll INF = 1002003004005006007ll;
#else
const ll INF = 1002003004005006007ll;
// const ll INF = 1002003004;
#endif

const int M = 100000000;
const int dir_4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int dir_8[8][2] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};

/* ------------------------------------- */

vector<P> vec[4];
double e = 0.1;

signed main() {
    int n;
    scanf("%d", &n);
    rep(i, n) {
        int x, y;
        char d;
        scanf("%d%d", &x, &y);
        scanf(" %c", &d);
        if (d == 'R') {
            vec[0].pb(mp(x, y));
        } else if (d == 'L') {
            vec[1].pb(mp(x, y));
        } else if (d == 'U') {
            vec[2].pb(mp(x, y));
        } else if (d == 'D') {
            vec[3].pb(mp(x, y));
        }
    }

    double rt0, rt1, lt0, lt1, ut0, ut1, dt0, dt1;

    /* ------------------------------------- */
    // 全部xでソート
    sort(vec[0].begin(), vec[0].end(), [](const P a, const P b) {
        if (a.fr != b.fr)
            return a.fr < b.fr;
        else
            return a.sc < b.sc;
    });
    sort(vec[1].begin(), vec[1].end(), [](const P a, const P b) {
        if (a.fr != b.fr)
            return a.fr < b.fr;
        else
            return a.sc < b.sc;
    });
    sort(vec[2].begin(), vec[2].end(), [](const P a, const P b) {
        if (a.fr != b.fr)
            return a.fr < b.fr;
        else
            return a.sc < b.sc;
    });
    sort(vec[3].begin(), vec[3].end(), [](const P a, const P b) {
        if (a.fr != b.fr)
            return a.fr < b.fr;
        else
            return a.sc < b.sc;
    });
    // x方向の最大値について
    double rma, lma, oma;
    rma = vec[0].empty() ? -INF : (*vec[0].rbegin()).fr;
    lma = vec[1].empty() ? -INF : (*vec[1].rbegin()).fr;
    oma = max(vec[2].empty() ? -INF : (*vec[2].rbegin()).fr,
              vec[3].empty() ? -INF : (*vec[3].rbegin()).fr);
    if (rma + e >= lma && rma + e >= oma) {
        rt0 = rt1 = 0;
    } else if (oma + e >= lma && oma + e >= rma) {
        rt0 = 0;
        rt1 = oma - rma;
    } else if ((oma <= rma + e && rma <= lma + e) ||
               (rma <= oma + e && oma <= lma + e && lma - oma + e >= oma - rma)) {
        rt0 = rt1 = (lma - rma) * 0.5;
    } else {
        rt0 = lma - oma;
        rt1 = oma - rma;
    }
    // x方向の最小値について
    double rmi, lmi, omi;
    rmi = vec[0].empty() ? INF : (*vec[0].begin()).fr;
    lmi = vec[1].empty() ? INF : (*vec[1].begin()).fr;
    omi = min(vec[2].empty() ? INF : (*vec[2].begin()).fr,
              vec[3].empty() ? INF : (*vec[3].begin()).fr);
    if (lmi <= rmi + e && lmi <= omi + e) {
        lt0 = lt1 = 0;
    } else if (omi <= rmi + e && omi <= lmi + e) {
        lt0 = 0;
        lt1 = lmi - omi;
    } else if ((omi + e >= lmi && lmi + e >= rmi) ||
               (lmi + e >= omi && omi + e >= rmi && lmi - omi <= omi - rmi + e)) {
        lt0 = lt1 = (lmi - rmi) * 0.5;
    } else {
        lt0 = omi - rmi;
        lt1 = lmi - omi;
    }

    /* ------------------------------------- */
    // 全部yでソート
    sort(vec[0].begin(), vec[0].end(), [](const P a, const P b) {
        if (a.sc != b.sc)
            return a.sc < b.sc;
        else
            return a.fr < b.fr;
    });
    sort(vec[1].begin(), vec[1].end(), [](const P a, const P b) {
        if (a.sc != b.sc)
            return a.sc < b.sc;
        else
            return a.fr < b.fr;
    });
    sort(vec[2].begin(), vec[2].end(), [](const P a, const P b) {
        if (a.sc != b.sc)
            return a.sc < b.sc;
        else
            return a.fr < b.fr;
    });
    sort(vec[3].begin(), vec[3].end(), [](const P a, const P b) {
        if (a.sc != b.sc)
            return a.sc < b.sc;
        else
            return a.fr < b.fr;
    });
    // y方向の最大値について
    rma = vec[2].empty() ? -INF : (*vec[2].rbegin()).sc;
    lma = vec[3].empty() ? -INF : (*vec[3].rbegin()).sc;
    oma = max(vec[0].empty() ? -INF : (*vec[0].rbegin()).sc,
              vec[1].empty() ? -INF : (*vec[1].rbegin()).sc);
    if (rma + e >= lma && rma + e >= oma) {
        ut0 = ut1 = 0;
    } else if (oma + e >= lma && oma + e >= rma) {
        ut0 = 0;
        ut1 = oma - rma;
    } else if ((oma <= rma + e && rma <= lma + e) ||
               (rma <= oma + e && oma <= lma + e && lma - oma + e >= oma - rma)) {
        ut0 = ut1 = (lma - rma) * 0.5;
    } else {
        ut0 = lma - oma;
        ut1 = oma - rma;
    }
    // y方向の最小値について
    rmi = vec[2].empty() ? INF : (*vec[2].begin()).sc;
    lmi = vec[3].empty() ? INF : (*vec[3].begin()).sc;
    omi = min(vec[0].empty() ? INF : (*vec[0].begin()).sc,
              vec[1].empty() ? INF : (*vec[1].begin()).sc);
    if (lmi <= rmi + e && lmi <= omi + e) {
        dt0 = dt1 = 0;
    } else if (omi <= rmi + e && omi <= lmi + e) {
        dt0 = 0;
        dt1 = lmi - omi;
    } else if ((omi + e >= lmi && lmi + e >= rmi) ||
               (lmi + e >= omi && omi + e >= rmi && lmi - omi <= omi - rmi + e)) {
        dt0 = dt1 = (lmi - rmi) * 0.5;
    } else {
        dt0 = omi - rmi;
        dt1 = lmi - omi;
    }

    disp(rt0, rt1, lt0, lt1, ut0, ut1, dt0, dt1);

    double times[] = {rt0, rt1, lt0, lt1, ut0, ut1, dt0, dt1};
    double ret = INF;
    rep(i, 8) {
        double t = times[i];
        if (t > 2000000000ll)
            continue;
        double xma = -INF, xmi = INF, yma = -INF, ymi = INF;
        for (P p : vec[0]) {
            double x = p.fr;
            double y = p.sc;
            x += t;
            xma = max(x, xma);
            xmi = min(x, xmi);
            yma = max(y, yma);
            ymi = min(y, ymi);
        }
        for (P p : vec[1]) {
            double x = p.fr;
            double y = p.sc;
            x -= t;
            xma = max(x, xma);
            xmi = min(x, xmi);
            yma = max(y, yma);
            ymi = min(y, ymi);
        }
        for (P p : vec[2]) {
            double x = p.fr;
            double y = p.sc;
            y += t;
            xma = max(x, xma);
            xmi = min(x, xmi);
            yma = max(y, yma);
            ymi = min(y, ymi);
        }
        for (P p : vec[3]) {
            double x = p.fr;
            double y = p.sc;
            y -= t;
            xma = max(x, xma);
            xmi = min(x, xmi);
            yma = max(y, yma);
            ymi = min(y, ymi);
        }
        ret = min(ret, (xma - xmi) * (yma - ymi));
    }

    printf("%lf\n", ret);

    /* --------------------------------- */
    return 0;
};

Measured memory_bytes: 1276