Given an integer n, and n objects, the value of the i-th object is a_i, you need to find the minimum value of \[ \sum_{i = 1}^{n} i * a_i \] However, you can swap the values of any two objects arbitrarily many times.

Input format:

An integer n, followed by n lines each containing an integer a_i

Output format:

An integer, representing the minimum value.

Data range:

1 ≤ n ≤ 100000, 0 ≤ a_i ≤ 100000

Input sample:

3
4
1
3

Output sample:

13