#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}
struct multi {
  ll first;
  ll second;
  ll third;
  multi(ll first, ll second, ll third)
      : first(first), second(second), third(third) {}
};
bool multicomp(const multi &a, const multi &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  vector<long double> X(N), Y(N);
  vector<char> D(N);
  REP(i, N) cin >> X[i] >> Y[i] >> D[i];

  long double XNmax = -llINF;
  long double XNmin = llINF;
  long double XRmin = llINF;
  long double XRmax = -llINF;
  long double XLmin = llINF;
  long double XLmax = -llINF;
  REP(i, N) {
    if (D[i] == 'R') {
      XRmax = max(XRmax, X[i]);
      XRmin = min(XRmin, X[i]);
    } else if (D[i] == 'L') {
      XLmin = min(XLmin, X[i]);
      XLmax = max(XLmax, X[i]);
    } else {
      XNmax = max(XNmax, X[i]);
      XNmin = min(XNmin, X[i]);
    }
  }

  long double YNmax = -llINF;
  long double YNmin = llINF;
  long double YUmax = -llINF;
  long double YDmax = -llINF;
  long double YDmin = llINF;
  long double YUmin = llINF;
  REP(i, N) {
    if (D[i] == 'U') {
      YUmax = max(YUmax, Y[i]);
      YUmin = min(YUmin, Y[i]);
    } else if (D[i] == 'D') {
      YDmin = min(YDmin, Y[i]);
      YDmax = max(YDmax, Y[i]);
    } else {
      YNmax = max(YNmax, Y[i]);
      YNmin = min(YNmin, Y[i]);
    }
  }
  long double ans = 1e36;
  vector<long double> t(12);
  t[0] = max((long double)0.0, XLmax - XNmax);
  t[1] = max((long double)0.0, XNmax - XRmax);
  t[2] = max((long double)0.0, (XLmax - XRmax) / 2);

  t[3] = max((long double)0.0, XNmin - XRmin);
  t[4] = max((long double)0.0, XLmin - XNmin);
  t[5] = max((long double)0.0, (XLmin - XRmin) / 2);

  t[6] = max((long double)0.0, YDmax - YNmax);
  t[7] = max((long double)0.0, (YDmax - YUmax) / 2);
  t[8] = max((long double)0.0, YNmax - YUmax),

  t[9] = max((long double)0.0, YNmin - YUmin);
  t[10] = max((long double)0.0, YDmin - YNmin);
  t[11] = max((long double)0.0, (YDmin - YUmin) / 2);

  // cout << t[7] << endl;

  REP(i, 12) {
    long double xmax = max(max(XNmax, XRmax + t[i]), XLmax - t[i]);
    long double xmin = min(min(XNmin, XRmin + t[i]), XLmin - t[i]);
    long double ymax = max(max(YNmax, YUmax + t[i]), YDmax - t[i]);
    long double ymin = min(min(YNmin, YUmin + t[i]), YDmin - t[i]);
    ans = min(ans, (xmax - xmin) * (ymax - ymin));
  }
  cout << SP(10) << ans << endl;

  return 0;
}


Measured memory_bytes: 3456