Young and ambitious manager of a transport company Plato got a big order for shipping products from the capital to *n* cities of the country. Every city is connected with the capital by a double-sided road. There are no other roads in the country.
The length of the road between the capital and the city number *i* equals *d*_{i} kilometers. What a coincidence, that a total weight of the products to ship to the city number *i* is exactly *d*_{i} tons.

Plato’s truck is loaded only once in the capital. Then Plato starts shipping the products. Of course, he is able to drive only on the road. He may visit the cities in any order, leaving necessary amount of products in each one. There is a tax system, working in the country. To transport *m* tons of cargo in *l* kilometers Plato has to pay *m* × *l* rubbles. Help Plato calculate the minimum amount of money he has to pay in order to ship all the products to the cities.

### Input

The first line contains a single integer *n* (1 ≤ *n* ≤ 10^{5}) — the number of cities in the country. The next line contains *n* integers separated with a space, *i*-th of which *d*_{i} (1 ≤ *d*_{i} ≤ 10^{4}) — is the length of the road between the city number *i* and the capital.

### Output

In a single line output the minimum amount of money Platon has to pay in order to ship all the products to the cities.

### Sample

**Problem Author: **Anna Khanova

**Problem Source: **University academic school olympiad in informatics 2019