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# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;

public class AtCoder{
	public static void Main(){
		
		int n;
		n = int.Parse(Console.ReadLine().Trim());
		int[] a = new int[n];
		
		for (int i=0; i<n; i++){
			a[i] = int.Parse(Console.ReadLine().Trim());
		}
		
		long s1 = 0;
		long s2 = 0;
		
		Array.Sort(a);
		
		if(n%2==1){
			for(int i=0; i<n; i++){
				if(i<=(n-2)/2){
					s1 -= a[i]*2;
				}else if(i<=2+(n-2)/2){
					s1 += a[i];
				}else{
					s1 += a[i]*2;
				}
			}
			for(int i=0; i<n; i++){
				if(i<=-1+(n-2)/2){
					s2 -= a[i]*2;
				}else if(i<=1+(n-2)/2){
					s2 -= a[i];
				}else{
					s2 += a[i]*2;
				}
			}
			if(s1<s2){
				Console.WriteLine(s2);
			}else{
				Console.WriteLine(s1);
			}
		}else{
			for(int i=0; i<n; i++){
				if(i<=-1+(n-2)/2){
					s1 -= a[i]*2;
				}else if(i<=(n-2)/2){
					s1 -= a[i];
				}else if(i<=1+(n-2)/2){
					s1 += a[i];
				}else{
					s1 += a[i]*2;
				}
			}
				Console.WriteLine(s1);
		}
	}
}