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 JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

function myout(text){console.log(text);}//standard output
function Main(input) {
	//input = parseInt(input);
	//input = input.split(" ");
	//input = input.split("\n");
	//input = input.split(" ").map((a)=>Number(a));
	input = input.split("\n").map((a)=>Number(a));
  var N = input[0];
  input.shift();
  input.sort(function(a,b){
  	return a - b;
  });
  var list = [];
  list.push(input.shift());
  var count = 0;
  while(input.length != 0){
    try{
        if(count % 2 == 0){
    		list.push(input.pop());
          if(input.length == 0){break;}
    		list.unshift(input.pop());
    	}else{
          	list.push(input.shift());
          if(input.length == 0){break;}
    		list.unshift(input.shift());
        }
      count++;
    }catch(e){
    }
  }
  var output = 0;
  for(var i = 0; i < list.length - 1; i++){
    var mae = list[i];
    var ato = list[i+1];
    output += Math.abs(mae - ato);
  }
  myout(output);
}

Main(require("fs").readFileSync("/dev/stdin", "utf8").trim());