#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using treap = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se second
using ii = pair<int, int>;
vector<ii> dirs = {
  {1, 0}, {0, 1}, {-1, 0}, {0, -1},  // 4方向
  {1, 1}, {-1, 1}, {-1, -1}, {1, -1},  // 斜め
  {0, 0},  // 自身
};
template <class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template <class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <class T, class S> vector<T> make_vec(size_t n, S x) { return vector<T>(n, x); }
template <class T, class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(n, make_vec<T>(ts...)); }

// debug
template <class T> ostream& operator<<(ostream& s, vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }
template <class T> ostream& operator<<(ostream& s, vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n"); return s; }
template <class T, class S> ostream& operator<<(ostream& s, pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }
template <class T, class S> ostream& operator<<(ostream& s, map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T, class S> ostream& operator<<(ostream& s, unordered_map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
#ifdef _MY_DEBUG
  #define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";
#else
  #define dump(...)
  #define endl "\n"
#endif
void dump_func() { cerr << endl; }
template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }

struct Fast { Fast() { cin.tie(0); ios::sync_with_stdio(false); } } fast;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
constexpr int MOD = 1000000007;
// *************** TEMPLATE END *************** 

const double INF = 1e16 + 10;
signed main() {
  int n; cin >> n;
  vector<double> x(n), y(n);
  vector<char> d(n);
  REP (i, n) cin >> x[i] >> y[i] >> d[i];
  auto calc = [&](double t) {
    // x
    double xmi = INF, xma = -INF;
    double ymi = INF, yma = -INF;
    REP (i, n) {
      double xi = x[i], yi = y[i];
      if (d[i] == 'R') xi += t;
      if (d[i] == 'L') xi -= t;
      if (d[i] == 'U') yi += t;
      if (d[i] == 'D') yi -= t;
      chmin(xmi, xi);
      chmax(xma, xi);
      chmin(ymi, yi);
      chmax(yma, yi);
    }
    assert(xma >= xmi);
    assert(yma >= ymi);
    return (xma - xmi) * (yma - ymi);
  };

  double rmi = INF, rma = -INF;
  double lmi = INF, lma = -INF;
  double smi = INF, sma = -INF;
  
  double umi = INF, uma = -INF;
  double dmi = INF, dma = -INF;
  double tmi = INF, tma = -INF;
  REP (i, n) {
    if (d[i] == 'R') {
      chmin(rmi, x[i]);
      chmax(rma, x[i]);
      chmin(tmi, y[i]);
      chmax(tma, y[i]);
    }
    if (d[i] == 'L') {
      chmin(lmi, x[i]);
      chmax(lma, x[i]);
      chmin(tmi, y[i]);
      chmax(tma, y[i]);
    }
    if (d[i] == 'U') {
      chmin(umi, y[i]);
      chmax(uma, y[i]);
      chmin(smi, x[i]);
      chmax(sma, x[i]);
    }
    if (d[i] == 'D') {
      chmin(dmi, y[i]);
      chmax(dma, y[i]);
      chmin(smi, x[i]);
      chmax(sma, x[i]);
    }
  }
  vector<double> tis = {0};
  for (double r : {rmi, rma}) {
    for (double l : {lmi, lma}) {
      tis.push_back(abs(r - l) / 2);
      for (double s : {smi, sma}) {
        tis.push_back(abs(r - s));
        tis.push_back(abs(l - s));
      }
    }
  }
  for (double r : {umi, uma}) {
    for (double l : {dmi, dma}) {
      tis.push_back(abs(r - l) / 2);
      for (double s : {tmi, tma}) {
        tis.push_back(abs(r - s));
        tis.push_back(abs(l - s));
      }
    }
  }
  double ans = INF * INF;
  for (double ti : tis) {
    if (ti > 1e9) continue;
    assert(ti >= 0);
    chmin(ans, calc(ti));
  }
  cout << setprecision(15) << ans << endl;
}


Measured memory_bytes: 1920