Description

At the neighborhood cafe 'CodeBean', N customers rush in the moment it opens and all order drinks at once. The barista can make only one drink at a time, and each order's cook time (minutes) is given. A customer waits until their drink is ready; one customer's 'waiting time' is the total time from the start until their order is finished. When the barista may freely choose the processing order, decide the order that minimizes the sum of every customer's waiting time, and find that minimum total waiting time.

Input

Output

Constraints

• •1 ≤ N ≤ 100,000
• •1 ≤ each cook time ≤ 1,000
• •The barista makes only one drink at a time (single server)
• •All customers order at the same opening time (minute 0)

Examples

5
3 1 4 1 5

31

3
2 2 2

12