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: Runtime Error)

import java.util.ArrayList;
import java.util.Scanner;
import java.util.Collections;

public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		ArrayList <Integer> intList = new ArrayList <Integer> ();
		ArrayList <Integer> LastList = new ArrayList <Integer> ();
		int cost = 0;
		// 整数の入力　ループ回数
		int N = sc.nextInt();
		
		for(int i = 0 ; i < N; i++){
			// 整数の入力　
			int A = sc.nextInt();
			intList.add(A);
		}
		//小さい順にソート
		Collections.sort(intList);
		
		int firstSmall = intList.get(0);
		int secondSmall = intList.get(1);
		int MostLarge =  intList.get(intList.size() -1);
		int MoreNumber =  intList.get(intList.size() -2);
		int Number =  intList.get(intList.size() -3);
		
		cost += MostLarge - firstSmall;
		cost += MostLarge - secondSmall;
		
		cost += Number - secondSmall;
		cost += MoreNumber - firstSmall;
		
		for(int i = intList.size()-4; i >= 2; i--){
			cost += intList.get(i + 2) - intList.get(i);
		}
		System.out.println(cost);
		
	}
}