Problem: 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}.

Examples

Input

2
0 3 D
3 0 L


Output

0


Input

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


Output

97.5


Input

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


Output

273

Solution (in PYTHON):

Solution:
#!/usr/bin/env python

from collections import deque, defaultdict
import itertools as ite
import sys
import math
import decimal

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

N = input()

UMaxY = DMaxY = OMaxY = -INF
UMinY = DMinY = OMinY = INF
LMaxX = RMaxX = OMaxX = -INF
LMinX = RMinX = OMinX = INF

for i in range(N):
    x, y, d = raw_input().split()
    x, y = int(x) * 2, int(y) * 2
    if d == 'U':
        UMaxY = max(UMaxY, y)
        UMinY = min(UMinY, y)
        OMaxX = max(OMaxX, x)
        OMinX = min(OMinX, x)
    if d == 'D':
        DMaxY = max(DMaxY, y)
        DMinY = min(DMinY, y)
        OMaxX = max(OMaxX, x)
        OMinX = min(OMinX, x)
    if d == 'L':
        OMaxY = max(OMaxY, y)
        OMinY = min(OMinY, y)
        LMaxX = max(LMaxX, x)
        LMinX = min(LMinX, x)
    if d == 'R':
        OMaxY = max(OMaxY, y)
        OMinY = min(OMinY, y)
        RMaxX = max(RMaxX, x)
        RMinX = min(RMinX, x)
'''
print UMaxY, DMaxY, OMaxY
print UMinY, DMinY, OMinY
print LMaxX, RMaxX, OMaxX
print LMinX, RMinX, OMinX
'''
ts = [0]
ts += [DMaxY - OMaxY, OMaxY - UMaxY, (DMaxY - UMaxY) / 2]
ts += [DMinY - OMinY, OMinY - UMinY, (DMinY - UMinY) / 2]
ts += [LMaxX - OMaxX, OMaxX - RMaxX, (LMaxX - RMaxX) / 2]
ts += [LMinX - OMinX, OMinX - RMinX, (LMinX - RMinX) / 2]

ans = 10 ** 30
for t in ts:
    if t < 0 or 10 ** 10 < t:
        continue
    maxY = max(DMaxY - t, UMaxY + t, OMaxY)
    minY = min(DMinY - t, UMinY + t, OMinY)
    maxX = max(LMaxX - t, RMaxX + t, OMaxX)
    minX = min(LMinX - t, RMinX + t, OMinX)
    ans = min(ans, (maxY - minY) * (maxX - minX))
print float(ans) / 4