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 (2.4.0) (judge verdict: Accepted)

n=int(input())
l=[]
for i in range(n):
    l.append(int(input()))
l.sort()
res=0
l1=l[:len(l)//2]
l2=l[len(l)//2:]
if len(l)%2==0:
    print(sum(l2)*2-l2[0]-sum(l1)*2+l1[-1])
else:
    res=sum(l2)*2-l2[0]-l2[1]-sum(l1)*2
    l1=l[:len(l)//2+1]
    l2=l[len(l)//2+1:]
    res=max(res,sum(l2)*2-sum(l1)*2+l1[-1]+l1[-2])
    print(res)