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;
using System.Collections.Generic;
class Program{
	static void Main(){
		int n=int.Parse(Console.ReadLine());
		long[] a=new long[n];
		long[] b=new long[n];
		long[] c=new long[n];
		long d=0,e=0;
		for(int i=0;i<n;i++){
			a[i]=int.Parse(Console.ReadLine());
		}
		Array.Sort(a);
		if(n%2==0){
			for(int i=0;i<n/2;i++){b[i*2+1]=a[i];}
			for(int i=n/2;i<n;i++){b[(i-n/2)*2]=a[i];}
		}
		else{
			for(int i=0;i<n/2;i++){b[i*2+1]=a[i];}
			b[n-1]=a[n/2];
			for(int i=n/2+1;i<n;i++){b[(i-n/2)*2-2]=a[i];}
			for(int i=n-1;i>n/2;i--){c[i-(n-i)]=a[i];}
			c[n-1]=a[n/2];
			for(int i=0;i<n/2;i++){c[n-((i+1)*2)-1]=a[i];}
		}
		for(int i=1;i<n;i++){
			d+=Math.Abs(b[i-1]-b[i]);
			e+=Math.Abs(c[i-1]-c[i]);
		}
		Console.WriteLine("{0}",Math.Max(d,e));
	}
}