import java.util.*;

public class Main {
	public static void main (String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] arr = new int[n];
		for (int i = 0; i < n; i++) {
		    arr[i] = sc.nextInt();
		}
		Arrays.sort(arr);
		if (arr[0] == arr[n - 1]) {
		    System.out.println(1);
		    return;
		}
		long[]  sums = new long[n + 1];
		for (int i = 1; i <= n; i++) {
		    sums[i] = sums[i - 1] + arr[i - 1];
		}
		long min = Long.MAX_VALUE;
		for (int i = 1; i < n; i++) {
		    int left1 = 1;
		    int right1 = i;
		    int mid1 = (left1 + right1) / 2;
		    int left2 = i + 1;
		    int right2 = n;
		    int mid2 = (left2 + right2) / 2;
		    long sum1;
		    if ((right1 - left1 + 1) % 2 == 0) {
		        sum1 =  -sums[mid1] + sums[right1] - sums[mid1];
		    } else {
		        sum1 =  - sums[mid1 - 1] + sums[right1] - sums[mid1];
		    }
		    long sum2;
		    if ((right2 - left2 + 1) % 2 == 0) {
		        sum2 = - sums[mid2] + sums[left2 - 1] + sums[right2] - sums[mid2];
		    } else {
		        sum2 = - sums[mid2 - 1] +  sums[left2 - 1] + sums[right2] - sums[mid2];
		    }
		    min = Math.min(min, sum1 + sum2);
		}
		System.out.println(min);
  }
}