[USACO15JAN] Cow Rectangles G

约翰的 $N(1 \le N \le 500)$ 头奶牛的位置由坐标平面上的点来描述。这些奶牛分为两种：Holsteins 和 Guernseys。约翰想要修建一个矩形的围栏，围栏的边平行于 $x$ 轴或者 $y$ 轴，并且要求围栏中只有 Holsteins 类型的奶牛（一头奶牛在围栏的边边上也算在围栏以内）。 约翰想要使围栏围住进可能多的 Holsteins 奶牛，在此基础上，约翰希望围栏构成的矩形的面积尽可能小，请你计算出这个最小面积。 注意：围栏的长或宽为 $0$ 的情况是允许的。

The locations of Farmer John's N cows (1 <= N <= 500) are described by distinct points in the 2D plane. The cows belong to two different breeds: Holsteins and Guernseys. Farmer John wants to build a rectangular fence with sides parallel to the coordinate axes enclosing only Holsteins, with no Guernseys (a cow counts as enclosed even if it is on the boundary of the fence). Among all such fences, Farmer John wants to build a fence enclosing the maximum number of Holsteins. And among all these fences, Farmer John wants to build a fence of minimum possible area. Please determine this area. A fence of zero width or height is allowable.

INPUT: (file cowrect.in) The first line of input contains N. Each of the next N lines describes a cow, and contains two integers and a character. The integers indicate a point (x,y) (0 <= x, y <= 1000) at which the cow is located. The character is H or G, indicating the cow's breed. No two cows are located at the same point, and there is always at least one Holstein.

OUTPUT: (file cowrect.out) Print two integers. The first line should contain the maximum number of Holsteins that can be enclosed by a fence containing no Guernseys, and second line should contain the minimum area enclosed by such a fence.

5 
1 1 H 
2 2 H 
3 3 G 
4 4 H 
6 6 H 

2 
1