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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;

public class Main {

    long INF = Long.MAX_VALUE;

    public static void main(String[] args) {
        new Main().solve();
    }

    void solve() {
        Scanner sc = new Scanner(System.in);
        int N=sc.nextInt();
        int[] A=new int[N];
        for(int i=0;i<N;i++){
            A[i]=sc.nextInt();
        }
        int ans=0;
        Arrays.sort(A);
        if(N%2==0){
            for(int i=N-1;i>=(N/2)+1;i--){
                ans+=2*A[i];
            }
            for(int i=0;i<(N/2)-1;i++){
                ans-=2*A[i];
            }
            ans+=A[N/2];
            ans-=A[N/2-1];
        }else{
            for(int i=N-1;i>=(N/2)+1;i--){
                ans+=2*A[i];
            }
            for(int i=0;i<=(N/2)-2;i++){
                ans-=2*A[i];
            }
            ans-=A[N/2];
            ans-=A[N/2-1];
            int ans2=0;
            for(int i=N-1;i>=(N/2)+2;i--){
                ans2+=2*A[i];
            }
            for(int i=0;i<=(N/2)-1;i++){
                ans2-=2*A[i];
            }
            ans2+=A[N/2+1];
            ans2+=A[N/2];
            ans=Math.max(ans,ans2);
        }
        System.out.println(ans);
    }
}