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 Rust (1.15.1) (judge verdict: Wrong Answer)

// Try Tenka1
// author: Leonardone @ NEETSDKASU

fn main() {
	let mut stdin = String::new();
    std::io::Read::read_to_string(
    	&mut std::io::stdin(),
        &mut stdin).unwrap();
	let mut stdin = stdin.split_whitespace();
    let mut get = || stdin.next().unwrap();
    macro_rules! get {
    	($t:ty) => (get().parse::<$t>().unwrap());
        () => (get!(i64));
    }
    
    let n = get!(usize);
    let mut xs = vec![];
    for _ in 0..n {
    	xs.push(get!());
    }
    xs.sort();
    
    if n == 2 {
    	println!("{}", xs[1]-xs[0]);
        return;
    }
    
    let mut lp = 0;
    let mut rp = n - 1;
    
    let mut ans = 0;
    
    
    let d1 = xs[rp] -xs[lp];
    let d2 = xs[rp-1] - xs[lp];
    let e1 = xs[rp] -xs[lp];
    let e2 = xs[rp]-xs[lp+1];
    
    if d1+d2> e1+e2 {
    	ans += d1+d2;
        lp += 1;
    } else {
    	ans += e1+e2;
    	rp -= 1;
    }
    
    
    println!("{}", ans);
}