Container With Most Water

There is an array $h$ of integers of length $n$, representing the heights of $n$ vertical lines. For each $i$-th line, its endpoints are defined by the coordinates $(i,0)$ and $(i,h_i)$.

Find two lines that, together with the $x$-axis, form a container capable of holding the maximum amount of water.

Input

The first line contains the size $n(n\le 10^5)$ of the array $h$. The second line contains $n$ positive integers, the elements of the array $h$, each of which does not exceed $10^9$.

Output

Print the maximum volume of water that the container can hold.

Examples