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)

"use strict";
function Main(input) {
    let lines = input.split("\n").map(function (value) { return value - 0; });
    let N = lines.shift();
    let nums = new Array(N);
    for (let n = 0; n < N; n++) nums[n] = lines.shift();
    nums.sort(function (a, b) { return b - a; });
    let ary = new Array(N);
    let m = 0;
    let r = N - 1;
    for (let l = 0; l < N / 2; l++ , r--) {
        ary[m++] = nums[l];
        if (m < N) ary[m++] = nums[r];
    }
    let s = 0, s1 = 0;
    m = N - 1;
    for (let n = 0; n < N - 1; n++) {
        r = (Math.abs(ary[m] - ary[n]));
        s += r;
        m = n;
    }
    for (let n = 0; n < N - 1; n++) {
        r = (Math.abs(ary[n] - ary[n + 1]));
        s1 += r;
    }
    console.log(Math.max(s, s1));
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));