Problem:
Score : 600 points

Problem Statement

There are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x- or y- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follows:

If d_i = R, the i-th point moves in the positive x direction;

If d_i = L, the i-th point moves in the negative x direction;

If d_i = U, the i-th point moves in the positive y direction;

If d_i = D, the i-th point moves in the negative y direction.

You can stop all the points at some moment of your choice after they start moving (including the moment they start moving).
Then, let x_{max} and x_{min} be the maximum and minimum among the x-coordinates of the N points, respectively. Similarly, let y_{max} and y_{min} be the maximum and minimum among the y-coordinates of the N points, respectively.

Find the minimum possible value of (x_{max} - x_{min}) \times (y_{max} - y_{min}) and print it.

Constraints

1 \leq N \leq 10^5

-10^8 \leq x_i,\ y_i \leq 10^8

x_i and y_i are integers.

d_i is R, L, U, or D.

Input

Input is given from Standard Input in the following format:

N
x_1 y_1 d_1
x_2 y_2 d_2
.
.
.
x_N y_N d_N

Output

Print the minimum possible value of (x_{max} - x_{min}) \times (y_{max} - y_{min}).

The output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-9}.

Sample Input 1

2
0 3 D
3 0 L

Sample Output 1

0

After three seconds, the two points will meet at the origin. The value in question will be 0 at that moment.

Sample Input 2

5
-7 -10 U
7 -6 U
-8 7 D
-3 3 D
0 -6 R

Sample Output 2

97.5

The answer may not be an integer.

Sample Input 3

20
6 -10 R
-4 -9 U
9 6 D
-3 -2 R
0 7 D
4 5 D
10 -10 U
-1 -8 U
10 -6 D
8 -5 U
6 4 D
0 3 D
7 9 R
9 -4 R
3 10 D
1 9 U
1 -6 U
9 -8 R
6 7 D
7 -3 D

Sample Output 3

273

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
int i,i0,n,m;
struct node
{
    long double x,y;
    char dir;
}a[100005];
long double chk(long double x)
{
    long double minx=1e9,maxx=-1e9,miny=1e9,maxy=-1e9;
    for(int i=1;i<=n;i++)
    {
        if(a[i].dir=='R')
        {
            maxx=max(maxx,a[i].x+x),maxy=max(maxy,a[i].y);
            minx=min(minx,a[i].x+x),miny=min(miny,a[i].y);
        }
        if(a[i].dir=='L')
        {
            maxx=max(maxx,a[i].x-x),maxy=max(maxy,a[i].y);
            minx=min(minx,a[i].x-x),miny=min(miny,a[i].y);
        }
        if(a[i].dir=='U')
        {
            maxx=max(maxx,a[i].x),maxy=max(maxy,a[i].y+x);
            minx=min(minx,a[i].x),miny=min(miny,a[i].y+x);
        }
        if(a[i].dir=='D')
        {
            maxx=max(maxx,a[i].x),maxy=max(maxy,a[i].y-x);
            minx=min(minx,a[i].x),miny=min(miny,a[i].y-x);
        }
    }
    return (maxx-minx)*(maxy-miny);
}
int main()
{
    scanf("%d",&n);
    for(i=1;i<=n;i++)scanf("%Lf %Lf %c",&a[i].x,&a[i].y,&a[i].dir);
    long double l=0,r=2e8;
    while(l<r-0.0000000001)
    {
        long double mid=(l+r)/2,midl=(mid+l)/2,midr=(mid+r)/2;
        if(chk(midl)<chk(midr))r=midr;
        else l=midl;
    }
    printf("%Lf\n",chk(l));
    return 0;
}