#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_by_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

vector<lint> x, y;
vector<char> d;
lint N;
constexpr lint INF = 1e18;

double solve(double t)
{
    if (t < -0.1 or t >= INF * 0.9) return INF;
    double xmin = INF, xmax = -INF, ymin = INF, ymax = -INF;
    REP(i, x.size())
    {
        double a = x[i], b = y[i];
        if (d[i] == 'U') b += t;
        if (d[i] == 'D') b -= t;
        if (d[i] == 'R') a += t;
        if (d[i] == 'L') a -= t;
        mmin(xmin, a);
        mmax(xmax, a);
        mmin(ymin, b);
        mmax(ymax, b);
    }
    return (xmax - xmin) * (ymax - ymin);
}

vector<double> solve2(lint pl_min, lint pl_max, lint mi_min, lint mi_max)
{
    if (pl_min > INF * 0.9) return vector<double>();
    if (mi_min > INF * 0.9) return vector<double>();

    vector<double> ans;
    ans.push_back((mi_min - pl_min) / 2.0);
    ans.push_back((mi_min - pl_max) / 2.0);
    ans.push_back((mi_max - pl_min) / 2.0);
    ans.push_back((mi_max - pl_max) / 2.0);
    return ans;
}

vector<double> solve3(vector<lint> x, lint xmin, lint xmax, char cpl, char cmi)
{
    vector<double> ret;

    lint pl_max = -INF, pl_min = INF;
    lint mi_max = -INF, mi_min = INF;
    REP(i, N)
    {
        if (d[i] == cpl)
        {
            mmax(pl_max, x[i]);
            mmin(pl_min, x[i]);
        }
        if (d[i] == cmi)
        {
            mmax(mi_max, x[i]);
            mmin(mi_min, x[i]);
        }
    }
    ret.push_back(xmax - pl_max);
    ret.push_back(xmin - pl_max);
    ret.push_back(xmax - pl_min);
    ret.push_back(xmin - pl_min);
    ret.push_back(mi_max - xmax);
    ret.push_back(mi_max - xmin);
    ret.push_back(mi_min - xmax);
    ret.push_back(mi_min - xmin);
    for (auto v : solve2(pl_min, pl_max, mi_min, mi_max)) ret.push_back(v);
    return ret;
}

int main()
{
    cin >> N;
    x.resize(N);
    y.resize(N);
    d.resize(N);
    REP(i, N)
    {
        cin >> x[i];
        cin >> y[i];
        cin >> d[i];
    }

    lint xmin = INF, xmax = -INF, ymin = INF, ymax = -INF;
    REP(i, N)
    {
        if (d[i] == 'U' or d[i] == 'D')
        {
            mmax(xmax, x[i]);
            mmin(xmin, x[i]);
        }
        else
        {
            mmax(ymax, y[i]);
            mmin(ymin, y[i]);
        }
    }

    vector<double> check_times{0};
    for (auto v : solve3(x, xmin, xmax, 'R', 'L')) check_times.push_back(v);
    for (auto v : solve3(y, ymin, ymax, 'U', 'D')) check_times.push_back(v);

    double ret = INF;
    // dbg(check_times);
    for (auto t : check_times) mmin(ret, solve(t));
    cout << ret << endl;
    return 0;
}


Measured memory_bytes: 2688