/// However long the night,
///     The dawn will break
/// ICPC next year

#include<bits/stdc++.h>
using namespace std ;
const int N = 1e5+5 ;
const long double eps = 1e-11;

int n ,x[N] ,y[N] ,addx[N] ,addy[N] ;
char ch ;
int xx[128] ,yy[128] ;
long double f(long double add){
    long double minX = 1e18 ,maxX = -1e18 ,minY = 1e18 ,maxY = -1e18 ;
    for(int i=0;i<n;++i){
        minX = min(minX ,(long double)x[i] + add*addx[i]);
        maxX = max(maxX ,(long double)x[i] + add*addx[i]);
        minY = min(minY ,(long double)y[i] + add*addy[i]);
        maxY = max(maxY ,(long double)y[i] + add*addy[i]);
    }
    return (maxX - minX) * (maxY - minY) ;
}
long double ternarySearch(long double left,long double right){
    for(int i=0;i<=1000;++i){
        long double g = left + (right - left) / 3, h = left + 2 * (right - left) / 3;
        if(f(g) < f(h))    right = h;
        else    left = g; // change < to > if the fn inc then dec
    }
    return f((left + right) / 2);
}
int main(){
    xx['R'] = 1 ;
    xx['L'] = -1 ;
    yy['U'] = 1 ;
    yy['D'] = -1 ;
    scanf("%d",&n);
    for(int i=0;i<n;++i){
        scanf("%d%d %c",x+i,y+i,&ch);
        addx[i] = xx[ch] ;
        addy[i] = yy[ch] ;
    }
    cout << fixed << setprecision(15) << ternarySearch(0,1e9+5);
    return 0;
}
