#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

//改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007


//ここから編集する
class Solve {
public:
    int N;
    vector<ll> x, y;
    vector<char> d;
//    ll minmX = INFl, minmY = INFl, maxmX = INFl, maxmY = INFl; // 動く法
    ll minpX = INFl, minpY = INFl, maxpX = -INFl, maxpY = -INFl; // 動かない方
    ll minRx = INFl, minLx = INFl, maxRx = -INFl, maxLx = -INFl;
    ll minDy = INFl, minUy = INFl, maxDy = -INFl, maxUy = -INFl;

    void input() {
        cin >> N;
        x.resize(N);
        y.resize(N);
        d.resize(N);
        rep(i, 0, N) {
            cin >> x[i] >> y[i] >> d[i];
        }

        rep(i, 0, N) {
            if (d[i] == 'R') {
                chmin(minRx, x[i]);
                chmax(maxRx, x[i]);
                chmin(minpY, y[i]);
                chmax(maxpY, y[i]);
            } else if (d[i] == 'L') {
                chmin(minLx, x[i]);
                chmax(maxLx, x[i]);
                chmin(minpY, y[i]);
                chmax(maxpY, y[i]);
            } else if (d[i] == 'D') {
                chmin(minDy, y[i]);
                chmax(maxDy, y[i]);
                chmin(minpX, x[i]);
                chmax(maxpX, x[i]);
            } else if (d[i] == 'U') {
                chmin(minUy, y[i]);
                chmax(maxUy, y[i]);
                chmin(minpX, x[i]);
                chmax(maxpX, x[i]);
            }
        }
    }

    double calc(double t) {
        double lx = min({1.0 * minpX, minRx + t, minLx - t}); // minpX, minRx + t, minRx - t のうち最小;
        double rx = max({1.0 * maxpX, maxRx + t, maxLx - t}); // minpX, minRx + t, minRx - t のうち最小;
        double dy = min({1.0 * minpY, minUy + t, minDy - t}); // minpX, minRx + t, minRx - t のうち最小;
        double uy = max({1.0 * maxpY, maxUy + t, maxDy - t}); // minpX, minRx + t, minRx - t のうち最小;

        return (rx - lx) * (uy - dy);
    }

    void solve() {
        input();

        vector<double> kouho;
        kouho.push_back(0.0);

        double tmp = 1.0 * (minDy - minUy) / 2;
        kouho.push_back(tmp);
        tmp = 1.0 * (minpY - minUy);
        kouho.push_back(tmp);
        tmp = 1.0 * (minDy - minpY);
        kouho.push_back(tmp);

        tmp = 1.0 * (maxDy - maxUy) / 2;
        kouho.push_back(tmp);
        tmp = 1.0 * (maxpY - maxUy);
        kouho.push_back(tmp);
        tmp = 1.0 * (maxDy - maxpY);
        kouho.push_back(tmp);

        tmp = 1.0 * (minLx - minRx) / 2;
        kouho.push_back(tmp);
        tmp = 1.0 * (minpX - minRx);
        kouho.push_back(tmp);
        tmp = 1.0 * (minLx - minpX);
        kouho.push_back(tmp);

        tmp = 1.0 * (maxLx - maxRx) / 2;
        kouho.push_back(tmp);
        tmp = 1.0 * (maxpX - maxRx);
        kouho.push_back(tmp);
        tmp = 1.0 * (maxLx - maxpX);
        kouho.push_back(tmp);

//        double tmp = min({1.0 * (minUy - minDy) / 2, 1.0 * (minUy + minpY)});
//        kouho.push_back(tmp);
//        tmp =
//
//        tmp = max(1.0 * (maxUy + maxDy) / 2, 1.0 * (maxDy + maxpY));
//        kouho.push_back(tmp);
//
//        tmp = min(1.0 * (minLx + minRx) / 2, 1.0 * (minLx + minpX));
//        kouho.push_back(tmp);
//
//        tmp = max(1.0 * (maxRx + maxLx) / 2, 1.0 * (maxRx + maxpX));
//        kouho.push_back(tmp);



        double ans = calc(kouho[0]);
        for (auto e : kouho) {
            if (e >= 0) {
                double tmp = calc(e);
                chmin(ans, tmp);
            }
        }

        cout << ans << endl;
    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    Solve().solve();


    return 0;
}


Measured memory_bytes: 1920