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 PyPy3 (7.3.0) (judge verdict: Wrong Answer)

from collections import deque
N = int(input())
A = sorted([int(input()) for _ in range(N)])
B = deque([A[0]])
ind = 1
cur0=1
cur1=N-1
cnt = 0
while cur0<=cur1:
    if ind==1:
        a = A[cur1]
        ar = abs(a-B[-1])
        al = abs(a-B[0])
        if ar>=al:
            cnt += ar
            B.append(a)
        else:
            cnt += al
            B.appendleft(a)
        cur1 -= 1
    else:
        a = A[cur0]
        ar = abs(B[-1]-a)
        al = abs(B[0]-a)
        if ar>=al:
            cnt += ar
            B.append(a)
        else:
            cnt += al
            B.appendleft(a)
        cur0 += 1
    ind = 1-ind
print(cnt)