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 {
    public static void main(String args[]) throws Exception {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long[] arr = new long[n];
        for(int i = 0; i < n; i++)
        	arr[i] = sc.nextLong();
        Arrays.sort(arr);
        long sum = 0L;
       	long head = arr[n-1], tail = head;
       	int left = 0, right = n - 2;
        while(left < right) {
        	if(Math.abs(arr[left] - head) > Math.abs(arr[left] - tail)) {
        		sum += Math.abs(arr[left] - head);
        		head = arr[left];
        	} else {
        		sum += Math.abs(arr[left] - tail);
        		tail = arr[left];
        	}
        	left++;

        	if(Math.abs(arr[right] - head) > Math.abs(arr[right] - tail)) {
        		sum += Math.abs(arr[right] - head);
        		head = arr[right];
        	} else {
        		sum += Math.abs(arr[right] - tail);
        		tail = arr[right];
        	}
        	right--;

        }
        if(left == right)
            sum += Math.max(Math.abs(arr[right] - head), Math.abs(arr[right] - tail));
        System.out.println(sum);
    }
}