import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.math.MathContext;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Random;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        Solver solver = new Solver(System.in, out);
        solver.solve();
        out.close();
    }
}
class Solver {
	Scanner sc;
	PrintWriter out;
    public Solver(InputStream in, PrintWriter out) {
    	sc = new Scanner(in);
    	this.out = out;
    }
    // ==========================================================
	int N;
	int[] A;
	boolean check(int cnt, int center) {
		int val = A[center - cnt] + A[N - cnt] - A[center] * 2;
//		out.println("A[" + (center - cnt) + "] = " + A[center - cnt]
//				+ " + A[" + (N-cnt) + "] = " + A[N - cnt]
//				+ " - A[" + center + "] = " + A[center]
//				+ " * 2  -->  val = " + val);
		if(val >= 0)	return true;
		else			return false;
	}
	int calc(int l, int r, int center) {
		int mid;
		while(Math.abs(l - r) > 1) {
			mid = (l + r) / 2;
			if(check(mid, center))	l = mid;
			else					r = mid;
		}
		return l;
	}
	public void solve() {
		N = ni();
		A = ndi(N);
		if(N <= 2) {
			out.println(0);
			return;
		}
		Arrays.sort(A);
		long[] wa = new long[N+1];
		for (int i = 0; i < N; i++) {
			wa[i+1] = wa[i] + A[i];
		}
		int k;
		long ans = 0, wk;
		for (int i = 1; i < N - 1; i++) {
			k = calc(0, Math.min(i, N - i - 1)+1, i);
			wk = wa[i] - wa[i-k] + wa[N] - wa[N-k] - A[i] * k * 2;
			ans = Math.max(ans, wk);
		}
		out.println(ans);
    }
    // Set に入れるなら　PPKEY　を使う！
    static class PP{
    	public int key, val;
    	public PP(int key, int val) {
    		this.key = key;
    		this.val = val;
    	}
		public int getKey() {
			return key;
		}
		public void setKey(int key) {
			this.key = key;
		}
		public int getVal() {
			return val;
		}
		public void setVal(int val) {
			this.val = val;
		}
    }
    // ------------------------------------------
    // 入力
    // ------------------------------------------
    public int ni() {
    	return sc.nextInt();
    }
    public long nl() {
    	return sc.nextLong();
    }
    public String ns() {
    	return sc.next();
    }
    public char[] nc() {
    	return sc.next().toCharArray();
    }
    public int[] ndi(int N) {
    	int[] ans = new int[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = ni();
		}
    	return ans;
    }
    public long[] ndl(int N) {
    	long[] ans = new long[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = nl();
		}
    	return ans;
    }
    public String[] nds(int N) {
    	String[] ans = new String[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = ns();
		}
    	return ans;
    }
    public char[][] ndc(int N) {
    	char[][] ans = new char[N][];
    	for (int i = 0; i < N; i++) {
			ans[i] = nc();
		}
    	return ans;
    }
    public int[][] nddi(int N, int S) {
    	int[][] ans = new int[N][S];
    	for (int i = 0; i < N; i++) {
			for (int j = 0; j < S; j++) {
				ans[i][j] = ni();
			}
		}
    	return ans;
    }
}