#include <cassert>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <chrono>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <random>
#include <memory>
#include <utility>
#include <limits>
#include "limits.h"
 
#define rep(i, a, b) for (long long (i) = (a); i < (b); i++)
#define all(i) i.begin(), i.end()
#define debug(...) std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

void debug_out(){std::cerr<<std::endl;}

template<typename Head,typename... Tail>
void debug_out(Head h,Tail... t){
  std::cerr<<" "<<h;
  debug_out(t...);
}
 
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
  return os << pa.first << " " << pa.second;
}
 
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (int i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}
 
template<typename T1,typename T2>
inline bool chmax(T1& a,T2 b){return a<b && (a=b,true);}
 
template<typename T1,typename T2>
inline bool chmin(T1& a,T2 b){return a>b && (a=b,true);}
 
long long pow_mod(long long a, long long b, long long mod=-1) {
  if(b==0)return 1;
  if ((a == 0)||(mod!=-1&&(a+mod)%mod==0)) {
    return 0;
  }
  long long x = 1;
  while (b > 0) {
    if (b & 1) {
      x = (mod!=-1)?(x * a) % mod:x*a;
    }
    a = (mod!=-1)?(a * a) % mod:a*a;
    b >>= 1;
  }
  return x;
}

// const long long MOD = 998244353;
const long long MOD = 1e9 + 7;

using ll = long long;
using P=std::pair<long long,long long>;

struct Point{
  P a;
  P mode;
  Point(P a_,P mode_):a(a_),mode(mode_){}
  P get(ll time){
    return {a.first+time*mode.first,a.second+time*mode.second};
  }
};

const ll MIN=std::numeric_limits<ll>::min();
const ll MAX=std::numeric_limits<ll>::max();

int main() {
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  ll n;
  std::cin>>n;

  std::vector<Point> point;

  rep(i,0,n){
    ll x,y;
    char d;
    std::cin>>x>>y>>d;
    P mode={0,0};
    if(d=='R')mode.first++;
    if(d=='L')mode.first--;
    if(d=='U')mode.second++;
    if(d=='D')mode.second--;
    point.emplace_back(P(2*x,2*y),mode);
  }

  std::vector<ll> candi;

  {
    ll left=-1,right=1e9;
    while(right-left>1){
      ll mid=left+(right-left)/2;

      ll val1=MIN,val2=MIN;
      rep(i,0,n){
        chmax(val1,point[i].get(mid).first);
        chmax(val2,point[i].get(mid+1).first);
      }
      if(val1<=val2)right=mid;
      else left=mid;
    }
    candi.push_back(right);
    left=-1;right=1e9;
    while(right-left>1){
      ll mid=left+(right-left)/2;

      ll val1=MIN,val2=MIN;
      rep(i,0,n){
        chmax(val1,point[i].get(mid).first);
        chmax(val2,point[i].get(mid+1).first);
      }
      if(val1<val2)right=mid;
      else left=mid;
    }
    candi.push_back(right);
  }

  {
    ll left=-1,right=1e9;
    while(right-left>1){
      ll mid=left+(right-left)/2;

      ll val1=MAX,val2=MAX;
      rep(i,0,n){
        chmin(val1,point[i].get(mid).first);
        chmin(val2,point[i].get(mid+1).first);
      }
      if(val1>=val2)right=mid;
      else left=mid;
    }
    candi.push_back(right);
    left=-1;right=1e9;
    while(right-left>1){
      ll mid=left+(right-left)/2;

      ll val1=MIN,val2=MIN;
      rep(i,0,n){
        chmax(val1,point[i].get(mid).first);
        chmax(val2,point[i].get(mid+1).first);
      }
      if(val1>val2)right=mid;
      else left=mid;
    }
    candi.push_back(right);
  }






  {
    ll left=-1,right=1e9;
    while(right-left>1){
      ll mid=left+(right-left)/2;

      ll val1=MIN,val2=MIN;
      rep(i,0,n){
        chmax(val1,point[i].get(mid).second);
        chmax(val2,point[i].get(mid+1).second);
      }
      if(val1<=val2)right=mid;
      else left=mid;
    }
    candi.push_back(right);
    left=-1;right=1e9;
    while(right-left>1){
      ll mid=left+(right-left)/2;

      ll val1=MIN,val2=MIN;
      rep(i,0,n){
        chmax(val1,point[i].get(mid).second);
        chmax(val2,point[i].get(mid+1).second);
      }
      if(val1<val2)right=mid;
      else left=mid;
    }
    candi.push_back(right);
  }

  {
    ll left=-1,right=1e9;
    while(right-left>1){
      ll mid=left+(right-left)/2;

      ll val1=MAX,val2=MAX;
      rep(i,0,n){
        chmin(val1,point[i].get(mid).second);
        chmin(val2,point[i].get(mid+1).second);
      }
      if(val1>=val2)right=mid;
      else left=mid;
    }
    candi.push_back(right);
    left=-1;right=1e9;
    while(right-left>1){
      ll mid=left+(right-left)/2;

      ll val1=MIN,val2=MIN;
      rep(i,0,n){
        chmax(val1,point[i].get(mid).second);
        chmax(val2,point[i].get(mid+1).second);
      }
      if(val1>val2)right=mid;
      else left=mid;
    }
    candi.push_back(right);
  }

  ll ans=MAX;

  for(auto time:candi){
    ll xmax=MIN,ymax=MIN;
    ll xmin=MAX,ymin=MAX;
    rep(i,0,n){
      P a=point[i].get(time);
      chmax(xmax,a.first);
      chmax(ymax,a.second);
      chmin(xmin,a.first);
      chmin(ymin,a.second);
    }
    chmin(ans,(xmax-xmin)*(ymax-ymin));
  }

  std::cout<<std::setprecision(10)<<std::fixed<<(long double)ans/4.0l<<"\n";


  return 0;
}


Measured memory_bytes: 6384