
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <random>

using namespace std;


int main()
{
	int N;
	vector<long long> Xs;
	vector<long long> Ys;
	vector<int> DXs;
	vector<int> DYs;

	cin >> N;	

	long long ymax = -2e9;
	long long xmax = -2e9;
	long long ymin = 2e9;
	long long xmin = 2e9;

	long long x, y;
	char c;
	for (int ni = 0; ni < N; ni++){
		cin >> x >> y >> c;
		x *= 2;
		y *= 2;
		Xs.push_back(x);
		Ys.push_back(y);
		if (c == 'U'){
			DXs.push_back(0);
			DYs.push_back(1);
		}else if(c == 'D'){
			DXs.push_back(0);
			DYs.push_back(-1);
		}else if(c == 'R'){
			DXs.push_back(1);
			DYs.push_back(0);
		}else if(c == 'L'){
			DXs.push_back(-1);
			DYs.push_back(0);
		}
		ymax = max(ymax, y);
		xmax = max(xmax, x);
		ymin = min(ymin, y);
		xmin = min(xmin, x);
	}

	long long A = (ymax - ymin) * (xmax - xmin);
	long long minA = A;

	int cnt = 0;
	long long w,h;
	h = (ymax - ymin);
	w = (xmax - xmin);

	while(cnt < 1e3){
		ymax = -2e9;
		xmax = -2e9;
		ymin = 2e9;
		xmin = 2e9;
		for(int ni = 0; ni < N; ni++){
			Xs[ni] += DXs[ni];
			Ys[ni] += DYs[ni];
			ymax = max(ymax, Ys[ni]);
			xmax = max(xmax, Xs[ni]);
			ymin = min(ymin, Ys[ni]);
			xmin = min(xmin, Xs[ni]);
		}
		A = (ymax - ymin) * (xmax - xmin);
		if (A < minA) {
			minA = A;
		}

		if ( (ymax - ymin) >= h && (xmax - xmin) >= w){
			break;
		}

		h = (ymax - ymin);
		w = (xmax - xmin);

	}

	printf("%f",(double)(minA/4.0));

	return 0;
}

