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 C (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include <stdio.h>
#include <stdlib.h>

int p[100001];
int n,max=0;

void perm(int i){
    int j,k,temp;

    if(i<n){
        for(j=i;j<=n;j++){
            temp=p[j];
            for(k=j;k>i;k--){
                p[k]=p[k-1];
            }
            p[i]=temp;
            perm(i+1);
            for(k=i;k<j;k++){
                p[k]=p[k+1];
            }
            p[j]=temp;
        }
    }else{
        int sum=0;

        for(j=2;j<=n;j++){
            sum+=abs(p[j-1]-p[j]);
        }

        if(sum>max){
            max=sum;
        }
    }
}


int main(){
    int i;

    scanf("%d",&n);    
    for(i=1;i<=n;i++){
        scanf("%d",&p[i]);
    }
    p[0]=0;

    perm(1);
    printf("%d",max);
    return 0;
}