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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Main main = new Main();
        main.solve();
    }
    public void solve() {
        Scanner scan = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        int N = scan.nextInt();
        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = scan.nextLong();
        }
        Arrays.sort(A);
        long ans = 0;
        long[] list = new long[N];
        int last = N - 1;
        int first = 0;
        if (N % 2 == 0) {
            for (int i = 0; i < N / 2; i++) {
                list[N / 2 - 1 - i] = i % 2 == 0 ? A[first++] : A[last--];
                list[N / 2 + i] = i % 2 == 0 ? A[last--] : A[first++];
            }
        } else {
            list[N / 2] = A[first++];
            for (int i = 0; i < N / 2; i++) {
                list[N / 2 - i - 1] = i % 2 == 0 ? A[last--] : A[first++];
                list[N / 2 + i + 1] = i % 2 == 0 ? A[last--] : A[first++];
            }
        }
        for (int i = 0; i < N - 1; i++) {
            ans += Math.abs(list[i]-list[i+1]);
        }
        System.out.println(ans);
    }
}