//Optimise
#include <bits/stdc++.h>
using namespace std;

// #define multitest 1
#define Debug 1
#ifdef Debug
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__);
template <typename Arg1>
void ZZ(const char *name, Arg1 &&arg1)
{
	std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&... args)
{
	const char *comma = strchr(names + 1, ',');
	std::cerr.write(names, comma - names) << " = " << arg1;
	ZZ(comma, args...);
}
#else
#define db(...)
#endif

typedef long long ll;
typedef long double ld;
#define f first
#define s second
#define pb push_back
const long long mod = 1000000007;

vector<int> x, y;
vector<char> d;
int n;

ld calc(ld time)
{
	ld xmin = 1e18, ymin = 1e18;
	ld xmax = -1e18, ymax = -1e18;
	for (int i = 0; i < n; ++i)
	{
		ld cx = x[i];
		ld cy = y[i];
		switch (d[i])
		{
		case 'R':
			cx += time;
			break;
		case 'L':
			cx -= time;
			break;
		case 'U':
			cy += time;
			break;
		case 'D':
			cy -= time;
			break;
		}
		xmin = min(xmin, cx);
		xmax = max(xmax, cx);
		ymin = min(ymin, cy);
		ymax = max(ymax, cy);
	}
	return (xmax - xmin) * (ymax - ymin);
}

ld ternary_search(ld low, ld high)
{
	for (int i = 0; i <= 500; ++i)
	{
		ld m1 = (low * 2 + high) / 3;
		ld m2 = (low + 2 * high) / 3;
		if (calc(m1) < calc(m2))
			high = m2;
		else
			low = m1;
	}
	return calc(low);
}

void solve()
{
	cin >> n;
	x.resize(n);
	y.resize(n);
	d.resize(n);
	for (int i = 0; i < n; ++i)
		cin >> x[i] >> y[i] >> d[i];
	cout << fixed << setprecision(12) << ternary_search(0, 2e8) << '\n';
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
#ifdef multitest
	cin >> t;
#endif
	while (t--)
		solve();
	return 0;
}
### Prompt

Generate a cpp solution to the following 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

### Response

```cpp
//Optimise
#include <bits/stdc++.h>
using namespace std;

// #define multitest 1
#define Debug 1
#ifdef Debug
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__);
template <typename Arg1>
void ZZ(const char *name, Arg1 &&arg1)
{
	std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&... args)
{
	const char *comma = strchr(names + 1, ',');
	std::cerr.write(names, comma - names) << " = " << arg1;
	ZZ(comma, args...);
}
#else
#define db(...)
#endif

typedef long long ll;
typedef long double ld;
#define f first
#define s second
#define pb push_back
const long long mod = 1000000007;

vector<int> x, y;
vector<char> d;
int n;

ld calc(ld time)
{
	ld xmin = 1e18, ymin = 1e18;
	ld xmax = -1e18, ymax = -1e18;
	for (int i = 0; i < n; ++i)
	{
		ld cx = x[i];
		ld cy = y[i];
		switch (d[i])
		{
		case 'R':
			cx += time;
			break;
		case 'L':
			cx -= time;
			break;
		case 'U':
			cy += time;
			break;
		case 'D':
			cy -= time;
			break;
		}
		xmin = min(xmin, cx);
		xmax = max(xmax, cx);
		ymin = min(ymin, cy);
		ymax = max(ymax, cy);
	}
	return (xmax - xmin) * (ymax - ymin);
}

ld ternary_search(ld low, ld high)
{
	for (int i = 0; i <= 500; ++i)
	{
		ld m1 = (low * 2 + high) / 3;
		ld m2 = (low + 2 * high) / 3;
		if (calc(m1) < calc(m2))
			high = m2;
		else
			low = m1;
	}
	return calc(low);
}

void solve()
{
	cin >> n;
	x.resize(n);
	y.resize(n);
	d.resize(n);
	for (int i = 0; i < n; ++i)
		cin >> x[i] >> y[i] >> d[i];
	cout << fixed << setprecision(12) << ternary_search(0, 2e8) << '\n';
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
#ifdef multitest
	cin >> t;
#endif
	while (t--)
		solve();
	return 0;
}
```