// includes {{{
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<random>
#include<cassert>
#include<bitset>
#include<cstdlib>
// #include<deque>
// #include<multiset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;

// #undef DEBUG
// #define DEBUG
// DEBUG {{{
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <tuple>
#include <valarray>
#include <vector>
template < int n, class... T >
typename std::enable_if< (n >= sizeof...(T)) >::type __output_tuple(
    std::ostream &, std::tuple< T... > const &) {}
template < int n, class... T >
typename std::enable_if< (n < sizeof...(T)) >::type __output_tuple(
    std::ostream &os, std::tuple< T... > const &t) {
  os << (n == 0 ? "" : ", ") << std::get< n >(t);
  __output_tuple< n + 1 >(os, t);
}
template < class... T >
std::ostream &operator<<(std::ostream &os, std::tuple< T... > const &t) {
  os << "(";
  __output_tuple< 0 >(os, t);
  os << ")";
  return os;
}
template < class T, class U >
std::ostream &operator<<(std::ostream &os, std::pair< T, U > const &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template < class T >
std::ostream &operator<<(std::ostream &os, const std::stack< T > &a) {
  os << "{";
  for(auto tmp = a; tmp.size(); tmp.pop())
    os << (a.size() == tmp.size() ? "" : ", ") << tmp.top();
  os << "}";
  return os;
}
template < class T, class Container, class Compare >
std::ostream &operator<<(std::ostream &os,
    std::priority_queue< T, Container, Compare > a) {
  os << "{ (top) ";
  while(a.size()) os << a.top() << (a.size() == 1 ? "" : ", "), a.pop();
  os << " }";
  return os;
}
template < class T, class Container >
std::ostream &operator<<(std::ostream &os, std::queue< T, Container > a) {
  os << "{ ";
  while(a.size()) os << a.front() << (a.size() == 1 ? "" : ", "), a.pop();
  os << " }";
  return os;
}
#ifdef DEBUG
#if !defined(DEBUG_OUT)
// #define DEBUG_OUT std::cerr
#endif
#define dump(...)                                                                \
  [&]() {                                                                        \
    auto __debug_tap = std::make_tuple(__VA_ARGS__);                             \
    DEBUG_OUT << "[" << __LINE__ << "] " << #__VA_ARGS__ << " = " << __debug_tap \
    << std::endl;                                                      \
  }()
template < class T >
inline void dump2D(T &d, size_t sizey, size_t sizex) {
  for(size_t i = 0; i < sizey; i++) {
    DEBUG_OUT << "\t";
    for(size_t j = 0; j < sizex; j++)
      DEBUG_OUT << d[i][j] << (j + 1 == sizex ? "" : "\t");
    DEBUG_OUT << std::endl;
  }
}
template < class T >
inline void dump1D(T &d, size_t sizey) {
  for(size_t i = 0; i < sizey; i++) {
    DEBUG_OUT << d[i] << (i + 1 == sizey ? "" : " ");
  }
  DEBUG_OUT << std::endl;
}
template <
class T, class = typename std::iterator_traits< decltype(begin(T())) >::value_type,
      class = typename std::enable_if< !std::is_same< T, std::string >::value >::type >
      std::ostream &operator<<(std::ostream &os, const T &a) {
        os << "{";
        for(auto ite = begin(a); ite != end(a); ++ite)
          os << (ite == begin(a) ? "" : ", ") << *ite;
        os << "}";
        return os;
      }
#else
#define dump(...) ((void) 42)
#define dump2D(...) ((void) 42)
#define dump1D(...) ((void) 42)
template <
class T, class = typename std::iterator_traits< decltype(begin(T())) >::value_type,
      class = typename std::enable_if< !std::is_same< T, std::string >::value >::type >
      std::ostream &operator<<(std::ostream &os, const T &a) {
        for(auto ite = begin(a); ite != end(a); ++ite)
          os << (ite == begin(a) ? "" : " ") << *ite;
        return os;
      }
#endif
// }}}

// ternary_search {{{
// needed iteration : log((hi - lo) / eps) / log(3. / 2)
template < class T, class Func >
T ternary_search(T lo, T hi, Func f, int c, bool maximize = 0) {
  for(int i = 0; i < c; i++) {
    T m1 = lo + (hi - lo) / 3;
    T m2 = lo + (hi - lo) * 2 / 3;
    if(maximize ? f(m1) > f(m2) : f(m1) < f(m2))
      hi = m2;
    else
      lo = m1;
  }
  return (lo + hi) / 2;
}

// needed iteration : log((hi - lo) / eps) / log(phi)
#include <cmath>
template < class T, class Func >
T golden_search(T lo, T hi, Func f, int c, bool maximize = 0) {
  const double phi_inv = 2 / (1 + sqrt(5));
  T v1, v2;
  bool f1 = 1, f2 = 1;
  for(int i = 0; i < c; i++) {
    T m1 = lo + (hi - lo) * (phi_inv * phi_inv);
    T m2 = lo + (hi - lo) * phi_inv;
    v1 = f1 ? f(m1) : v1;
    v2 = f2 ? f(m2) : v2;
    f1 = f2 = 0;
    if(maximize ? v1 > v2 : v1 < v2)
      hi = m2, v2 = v1, f1 = 1;
    else
      lo = m1, v1 = v2, f2 = 1;
  }
  return (lo + hi) / 2;
}
// }}}


ll x[112345], y[112345];
char d[112345];
int main() {
  std::ios::sync_with_stdio(false), std::cin.tie(0);
  int n;
  cin >> n;
  for(int i = 0; i < n; i++) {
    cin >> x[i] >> y[i] >> d[i];
  }
  const double inf = 2e8;
  auto f = [&] (double m) {
    double xmax = -inf*2, xmin = inf*2;
    double ymax = -inf*2, ymin = inf*2;
    for(int i = 0; i < n; i++){
      double X = x[i], Y = y[i];
      if(d[i] == 'L') {
        X -= m;
      }
      if(d[i] == 'R') {
        X += m;
      }
      if(d[i] == 'D') {
        Y -= m;
      }
      if(d[i] == 'U') {
        Y += m;
      }
      xmax = max(xmax, X);
      xmin = min(xmin, X);
      ymax = max(ymax, Y);
      ymin = min(ymin, Y);
    }
    return (xmax - xmin) * (ymax - ymin);
  };

  cout << fixed << setprecision(10);
  cout << f(ternary_search<double, decltype(f)>(0, inf, f, 300, 0)) << endl;
  return 0;
}


Measured memory_bytes: 1920