#include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
#define pb push_back
#define sz(i) (int)(i.size())
#define x first
#define y second
#define L long double
#define P pair<int, int>
const int inf = 0x3f3f3f3f3f3f3f3LL;
const int mod = (int)1e9 + 7;
using namespace std;
#if LOCAL
#include "../../tr.h"
#else
#define tr(...)
#define endl '\n'
#endif
template<class T> void smin(T& a, T val) {if (a > val) a = val;}template<class T> void smax(T& a, T val) {if (a < val) a = val;}
const int N = (int)1e5 + 10;

#define double long double
int n;
char d[N];
P pt[N];

double f(double till){
   double x[2], y[2];
   x[0] = 1e20;//min
   x[1] = -1e20;//max
   y[0] = 1e20;
   y[1] = -1e20;

   for (int i = 0; i < n; ++i)
   {
      double ptx = pt[i].x, pty = pt[i].y;
      if (d[i] == 'R'){
         ptx += till;
      }
      else if (d[i] == 'L'){
         ptx -= till;
      }
      else if (d[i] == 'U'){
         pty += till;
      }
      else{
         pty -= till;
      }
      smax(x[1], ptx);
      smin(x[0], ptx);
      smax(y[1], pty);
      smin(y[0], pty);
   }

   return (x[1] - x[0]) * (y[1] - y[0]);
}

double binary_search(double A, double B){
   double ans = 0;

   for (int i = 0; i < 300; ++i)
   {
      double m1 = (A * 2 + B) / 3.0;
      double m2 = (A + 2 * B) / 3.0;
      if (f(m1) > f(m2)){
         ans = m2;
         A = m1;
      }
      else{
         B = m2;
      }
   }

   return f(ans);
}

int32_t main(){_

   cout << fixed << setprecision(15);
   cin>>n;

   for (int i = 0; i < n; ++i)
   {
      cin>>pt[i].x>>pt[i].y>>d[i];
   }   

   cout<<binary_search(0, 1e10);

   return 0;
}