Problem:
Score : 400 points

Problem Statement

You are given N integers; the i-th of them is A_i.
Find the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers in a row in any order you like.

Constraints

2 \leq N \leq 10^5

1 \leq A_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1
:
A_N

Output

Print the maximum possible sum of the absolute differences between the adjacent elements after arranging the given integers in a row in any order you like.

Sample Input 1

5
6
8
1
2
3

Sample Output 1

21

When the integers are arranged as 3,8,1,6,2, the sum of the absolute differences between the adjacent elements is |3 - 8| + |8 - 1| + |1 - 6| + |6 - 2| = 21. This is the maximum possible sum.

Sample Input 2

6
3
1
4
1
5
9

Sample Output 2

25

Sample Input 3

3
5
5
1

Sample Output 3

8

Solution in Python (3.4.3) (judge verdict: Time Limit Exceeded)

N = int(input().strip('\n'))
lis = []
for i in range(N):
    lis.append(int(input().strip('\n')))
mx_n = max(lis)
ms_n = min(lis)
lis.remove(mx_n)
lis.remove(ms_n)
point = mx_n-ms_n
while len(lis)>=2:
    mx = max(lis)
    ms = min(lis)
    point += mx_n-ms
    point += mx-ms_n
    mx_n = mx
    ms_n = ms
    lis.remove(mx)
    lis.remove(ms)
if len(lis)==1:
    point += max(abs(mx_n-lis[0]),abs(ms_n-lis[0]))
print(point)