Warehouse Location

There are N shops on a number line, located at positions A₁ to A_N.

A warehouse needs to be built on the number line. Every morning, goods are delivered from the warehouse to each shop.

To maximize efficiency, find the location to build the warehouse such that the total distance from the warehouse to all shops is minimized.

Input Format

The first line contains an integer N.

The second line contains N integers A₁ to A_N.

Output Format

Output a single integer, representing the minimum total distance.

Constraints

1 ≤ N ≤ 100000
0 ≤ A_i ≤ 40000

Sample Input

4
6 2 9 1

Sample Output

12