import static java.lang.Math.*;

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.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.InputMismatchException;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static long LINF = 1L << 55;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {

		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int n = in.nextInt();
			long[] a = in.nextLongArray(n);
			Deque<Long> from = new ArrayDeque<Long>();
			Deque<Long> to = new ArrayDeque<Long>();

			Arrays.sort(a);
			for (long i : a) {
				from.addLast(i);
			}

			to.addFirst(from.removeFirst());

			int count = 0;
			while (!from.isEmpty()) {
				if (count % 2 == 0) {
					if (!from.isEmpty()) {
						long num = from.removeLast();
						to.addFirst(num);
					}
					if (!from.isEmpty()) {
						long num = from.removeLast();
						to.addLast(num);
					}
				} else {
					if (!from.isEmpty()) {
						long num = from.removeFirst();
						to.addFirst(num);
					}
					if (!from.isEmpty()) {
						long num = from.removeFirst();
						to.addLast(num);
					}
				}
				count++;
			}

			long[] b = new long[n];
			for (int i = 0; i < n; i++) {
				b[i] = to.removeFirst();
			}

			long ans = 0;
			for (int i = 0; i < n-1; i++) {
				ans += abs(b[i+1] - b[i]);
			}

			//////////////////////////////////////


			from.clear();
			for (long i : a) {
				from.addLast(i);
			}

			to.addFirst(from.removeLast());

			count = 0;
			while (!from.isEmpty()) {
				if (count % 2 == 0) {
					if (!from.isEmpty()) {
						long num = from.removeFirst();
						to.addFirst(num);
					}
					if (!from.isEmpty()) {
						long num = from.removeFirst();
						to.addLast(num);
					}
				} else {
					if (!from.isEmpty()) {
						long num = from.removeLast();
						to.addFirst(num);
					}
					if (!from.isEmpty()) {
						long num = from.removeLast();
						to.addLast(num);
					}
				}
				count++;
			}

			b = new long[n];
			for (int i = 0; i < n; i++) {
				b[i] = to.removeFirst();
			}

			long ans2 = 0;
			for (int i = 0; i < n-1; i++) {
				ans2 += abs(b[i+1] - b[i]);
			}

			out.println(max(ans, ans2));
		}
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public int[] nextIntArrayDec(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}

		public int[] nextIntArray1Index(int n) {
			int[] res = new int[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public long[] nextLongArrayDec(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}

		public long[] nextLongArray1Index(int n) {
			long[] res = new long[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextLong();
			}
			return res;
		}

		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}
	}

}


Measured memory_bytes: 45456