P10727 [NOISG 2023 Qualification] Area

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.

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 one integer, the maximum area.

### Constraints |$\text{Subtask}$|Score|Special property| |:-:|:-:|:-:| |$1$|$50$|$n=1$| |$2$|$50$|None| For all testdata, $1 \le n \le 100$, $1 \le h_i, w_i \le 1000$. Translated by ChatGPT 5