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: Wrong Answer)

import sys
input=sys.stdin.readline
n=int(input())
a=[int(input()) for _ in range(n)]
a.sort()

from collections import deque
l=deque(a)
ansl=deque()

if n%2==0:
    i=1
    while l:
        m=l.popleft()
        M=l.pop()
        if i%2:
            ansl.appendleft(m)
            ansl.append(M)
        else:
            ansl.append(m)
            ansl.appendleft(M)
        i+=1
else:
    ansl.append(l.popleft())
    i=1
    while l:
        if i%2:
            M=l.pop()
            m=l.pop()
            ansl.append(M)
            ansl.appendleft(m)
        else:
            M=l.popleft()
            m=l.popleft()
            ansl.append(M)
            ansl.appendleft(m)
        i+=1

ans=0
for i in range(n-1):
    ans+=abs(ansl[i]-ansl[i+1])
print(ans)