#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define fst first
#define snd second

/* clang-format off */
template <class T, size_t D> struct _vec { using type = vector<typename _vec<T, D - 1>::type>; };
template <class T> struct _vec<T, 0> { using type = T; };
template <class T, size_t D> using vec = typename _vec<T, D>::type;
template <class T> vector<T> make_v(size_t size, const T& init) { return vector<T>(size, init); }
template <class... Ts> auto make_v(size_t size, Ts... rest) { return vector<decltype(make_v(rest...))>(size, make_v(rest...)); }
template <class T> inline void chmin(T &a, const T& b) { if (b < a) a = b; }
template <class T> inline void chmax(T &a, const T& b) { if (b > a) a = b; }
/* clang-format on */

const ll INF = 1ll << 28;

struct Enclosure {
  double min, max;
  bool exists;
  Enclosure()
      : min(INF), max(-INF), exists(false) {
  }
  void expand(double x) {
    exists = true;
    chmin(min, x);
    chmax(max, x);
  }
  double dist() const {
    return max - min;
  }
};

vector<double> findEventPoints(const Enclosure& X, const Enclosure& L, const Enclosure& R) {
  vector<double> res;
  if (X.exists && L.exists) {
    if (X.max < L.max) res.push_back(L.max - X.max);
    if (X.min < L.min) res.push_back(L.min - X.min);
  }
  if (X.exists && R.exists) {
    if (X.max > R.max) res.push_back(X.max - R.max);
    if (X.min > R.min) res.push_back(X.min - R.min);
  }
  if (L.exists && R.exists) {
    if (L.max > R.max) res.push_back((L.max - R.max) * 0.5);
    if (L.min > R.min) res.push_back((L.min - R.min) * 0.5);
  }
  return res;
}

int main() {
#ifdef DEBUG
  ifstream ifs("in.txt");
  cin.rdbuf(ifs.rdbuf());
#endif
  int N;
  while (cin >> N) {
    vector<double> x(N), y(N);
    vector<char> dir(N);
    for (int i = 0; i < N; i++) cin >> x[i] >> y[i] >> dir[i];
    Enclosure X, Y, U, D, L, R;
    for (int i = 0; i < N; i++) {
      if (dir[i] == 'U') {
        U.expand(y[i]);
        X.expand(x[i]);
      }
      if (dir[i] == 'D') {
        D.expand(y[i]);
        X.expand(x[i]);
      }
      if (dir[i] == 'L') {
        L.expand(x[i]);
        Y.expand(y[i]);
      }
      if (dir[i] == 'R') {
        R.expand(x[i]);
        Y.expand(y[i]);
      }
    }
    auto f = [&](double t) {
      Enclosure nX = X, nY = Y;
      if (L.exists) {
        nX.expand(L.min - t);
        nX.expand(L.max - t);
      }
      if (R.exists) {
        nX.expand(R.min + t);
        nX.expand(R.max + t);
      }
      if (U.exists) {
        nY.expand(U.min + t);
        nY.expand(U.max + t);
      }
      if (D.exists) {
        nY.expand(D.min - t);
        nY.expand(D.max - t);
      }
      return nX.dist() * nY.dist();
    };
    vector<double> events = {0, INF};
    for (double t : findEventPoints(X, L, R)) events.push_back(t);
    for (double t : findEventPoints(Y, D, U)) events.push_back(t);
    double res = 1ll << 60;
    for (double t : events) chmin(res, f(t));
    printf("%.20lf\n", res);
  }
  return 0;
}


Measured memory_bytes: 1920