import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		new Main().run();
	}

	void run() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		long[] Y = new long[n];
		boolean f = true;
		for (int i = 0; i < n; ++i) {
			Y[i] = sc.nextLong();
			f &= Y[i] == Y[0];
		}
		if (f) {
			System.out.println(1);
			return;
		}
		Arrays.sort(Y);
		long ans = Long.MAX_VALUE / 3;
		for (int d1 = -10; d1 <= 10; ++d1) {
			for (int d2 = -10; d2 <= 10; ++d2) {
				if (n / 3 + d1 < 0 || n / 3 * 2 + d2 < 0 || n / 3 + d1 >= n || n / 3 * 2 + d2 >= n
						|| Y[n / 3 + d1] == Y[n / 3 * 2 + d2])
					continue;
				long ans_tmp = 0;
				for (int i = 0; i < n; ++i) {
					ans_tmp += Math.min(Math.abs(Y[i] - Y[n / 3 + d1]), Math.abs(Y[i] - Y[n / 3 * 2 + d2]));
				}
				ans = Math.min(ans, ans_tmp);
			}
		}
		System.out.println(ans);
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}