Cossack Vus and the Shop

After moving to a big city, Kozak Vus decided to start a small business by opening a jewelry store. He has $n$ pieces of jewelry, with the price of the $i$-th piece being $a_i$.

Due to the epidemic, jewelry sales have declined, prompting Kozak Vus to launch a promotional sale. Under this promotion, a customer can:

• Select a positive number $k$.

• Purchase all $m$ pieces of jewelry priced at least $k$ for a total of $k\cdot m$ coins. This means each piece with $a_i\ge k$ is bought for $k$ coins.

Kozak Vus wants to know the maximum amount he can receive from this promotional offer.

Input

The first line contains a single integer $n$ ($1\le n\le 10^5$) — the number of jewelry pieces Kozak Vus has.

The second line contains $n$ integers $a_1,a_2,\dots ,a_n$ ($1\le a_i\le 10^9$) — the price of the $i$-th piece.

Output

Output a single integer — the maximum number of coins Kozak Vus can earn from this promotion, which is the maximum value of $k\cdot m$, where $k$ is a positive integer, and $m$ is the number of jewelry pieces $i$ such that $k\le a_i$.

Examples

Note

In the first example, you can choose $k=7$, for which there are $3$ pieces with a price not less than $k$.

In the second example, you can choose $k=6$ and buy all.

Scoring

Each test is scored separately. You can earn $45$ points on tests where $n,a_i\le 1000$.