Problem Description

Stuart has $n$ rectangles. For the $i$-th rectangle, its length is $h_i$ and its width is $w_i$.

The area of a rectangle is the size of the region it covers. Stuart wants you to help him find the maximum area among these $n$ rectangles.

Input Format

The first line contains an integer $n$.

The next $n$ lines each contain two integers $h_i, w_i$, representing the length and width of the $i$-th rectangle.

Output Format

Output one integer, the maximum area.

3
5 9
19 4
8 10

80

5
8 2
4 9
3 8
1 7
9 4

36

Hint

Constraints

For all testdata, $1 \le n \le 100$, $1 \le h_i, w_i \le 1000$.

Translated by ChatGPT 5