polja

문제

Mickey is in the airplane above ground. On the ground, he sees fields of rectangular shapes and different colors, depending on planted vegetation. 

Mickey wants to know what is the area of the largest one-colored rectangle on the ground. 

On the picture you can see examples from the bottom of the page (solution for each example is marked): 

[이미지 1]

Write a program that will calculate the area of the largest one-colored rectangle on the ground. 

Two different fields will not overlap, however they may touch in corners or along sides. 

입력

First line of input contains an integer N, 1 ≤ N ≤ 2500, the number of fields on the ground. Each of the following N lines contains five integers X1, Y1, X2, Y2 (X1<X2, Y1<Y2) and C. 

These numbers represents one field (with sides parallel to coordinate axes) with coordinates of diagonal corners (X1,Y1) and (X2,Y2) and with color C, 1 ≤ C ≤ 100. All the coordinates will be integers between 0 and 1,000,000,000 (inclusive). 

출력

First and only line of output should contain the area from the problem statement. 

Note: solution will always fit into the signed 64-bit integer data type (int64 in Pascal, long long in C/C++).