import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.AbstractMap;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import static java.util.Comparator.*;


public class Main {
	
	public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        MyInput in = new MyInput(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        
        Solver solver = new Solver();
        solver.solve(1, in, out);
        
        out.close();
    }
    
    // ======================================================================
    static class Solver {

    	public void solve(int testNumber, MyInput in, PrintWriter out) {
    		int N = in.nextInt();
    		int[] A = new int[N];
    		int[] A2 = new int[N];
    		for(int i=0; i < N; i++) {
    			A[i] = in.nextInt();
    		}
    		Arrays.sort(A);
			int l = (N-1)/2;
			int r = l;
    		if(N % 2 == 0) {
    			l++;
    		}
//    		out.println("l = " + l + "  r = " + r);
    		long ans = 0;
    		int min = 0, max = N - 1;
    		for(int i=0; i < l; i++) {
    			ans += A[max] - A[min];
//    			out.println("left : i = " + i + "  ans(=" + ans + ") += A[" + max + "](=" 
//    					+ A[max] + ") - A[" + min + "](=" + A[min] + ")");
    			if(i == 0) {
    				min = 1;
    			} else {
    				if(i % 2 == 0) {
    					min += 2;
    				} else {
    					max -= 2;
    				}
    			}
    		}
    		min = 0; max = N - 2;
    		for(int i=0; i < r; i++) {
    			ans += A[max] - A[min];
//    			out.println("right : i = " + i + "  ans(=" + ans + ") += A[" + max + "](=" 
//    					+ A[max] + ") - A[" + min + "](=" + A[min] + ")");
				if(i % 2 == 0) {
					min += 2;
				} else {
					max -= 2;
				}
    		}
//            out.println("------ ans = " + ans);
    		long ans2 = 0;
    		min = 0; max = N - 1;
    		for(int i=0; i < l; i++) {
    			ans2 += A[max] - A[min];
//    			out.println("left : i = " + i + "  ans2(=" + ans2 + ") += A[" + max + "](=" 
//    					+ A[max] + ") - A[" + min + "](=" + A[min] + ")");
    			if(i == 0) {
    				max--;
    			} else {
    				if(i % 2 == 0) {
    					max -= 2;
    				} else {
    					min += 2;
    				}
    			}
    		}
    		min = 1; max = N - 1;
    		for(int i=0; i < r; i++) {
    			ans2 += A[max] - A[min];
//    			out.println("right : i = " + i + "  ans2(=" + ans2 + ") += A[" + max + "](=" 
//    					+ A[max] + ") - A[" + min + "](=" + A[min] + ")");
				if(i % 2 == 0) {
					max -= 2;
				} else {
					min += 2;
				}
    		}
//            out.println("------ ans2 = " + ans2);
    		if(ans > ans2)	out.println(ans);
    		else			out.println(ans2);
        }
    }
    static class PPP {
    	public int key, val;
    	public PPP(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;
		}
    }
    // ======================================================================
    static class Pair<K, V> extends AbstractMap.SimpleEntry<K, V> {
        /** serialVersionUID. */
        private static final long serialVersionUID = 6411527075103472113L;

        public Pair(final K key, final V value) {
            super(key, value);
        }
        public String getString() {
            return "[" + getKey() + "] [" + getValue() + "]";
        }
     }    
    static class MyInput {
        private final BufferedReader in;
        private static int pos;
        private static int readLen;
        private static final char[] buffer = new char[1024 * 8];
        private static char[] str = new char[500 * 8 * 2];
        private static boolean[] isDigit = new boolean[256];
        private static boolean[] isSpace = new boolean[256];
        private static boolean[] isLineSep = new boolean[256];
 
        static {
            for (int i = 0; i < 10; i++) {
                isDigit['0' + i] = true;
            }
            isDigit['-'] = true;
            isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;
            isLineSep['\r'] = isLineSep['\n'] = true;
        }
 
        public MyInput(InputStream is) {
            in = new BufferedReader(new InputStreamReader(is));
        }
 
        public int read() {
            if (pos >= readLen) {
                pos = 0;
                try {
                    readLen = in.read(buffer);
                } catch (IOException e) {
                    throw new RuntimeException();
                }
                if (readLen <= 0) {
                    throw new MyInput.EndOfFileRuntimeException();
                }
            }
            return buffer[pos++];
        }
 
        public int nextInt() {
            int len = 0;
            str[len++] = nextChar();
            len = reads(len, isSpace);
            int i = 0;
            int ret = 0;
            if (str[0] == '-') {
                i = 1;
            }
            for (; i < len; i++) ret = ret * 10 + str[i] - '0';
            if (str[0] == '-') {
                ret = -ret;
            }
            return ret;
        }
 
        public long nextLong() {
            int len = 0;
            str[len++] = nextChar();
            len = reads(len, isSpace);
            int i = 0;
            long ret = 0L;
            if (str[0] == '-') {
                i = 1;
            }
            for (; i < len; i++) ret = ret * 10 + str[i] - '0';
            if (str[0] == '-') {
                ret = -ret;
            }
            return ret;
        }
 
        public String nextString() {
        	String ret = new String(nextDChar()).trim();
            return ret;
        }
 
        public char[] nextDChar() {
            int len = 0;
            len = reads(len, isSpace);
            char[] ret = new char[len + 1];
            for (int i=0; i < len; i++)		ret[i] = str[i];
            ret[len] = 0x00;
            return ret;
        }
 
        public char nextChar() {
            while (true) {
                final int c = read();
                if (!isSpace[c]) {
                    return (char) c;
                }
            }
        }
 
        int reads(int len, boolean[] accept) {
            try {
                while (true) {
                    final int c = read();
                    if (accept[c]) {
                        break;
                    }
                    if (str.length == len) {
                        char[] rep = new char[str.length * 3 / 2];
                        System.arraycopy(str, 0, rep, 0, str.length);
                        str = rep;
                    }
                    str[len++] = (char) c;
                }
            } catch (MyInput.EndOfFileRuntimeException e) {
            }
            return len;
        }
 
        static class EndOfFileRuntimeException extends RuntimeException {
        }
    }
}


Measured memory_bytes: 25812