// yukicoder: 837 Noelちゃんと星々2
// 2019.6.16 bal4u

#include <stdio.h>
#include <stdlib.h>

#if 1
#define gc() getchar_unlocked()
#else
#define gc() getchar()
#endif
int in()   // 整数の入力（負数対応）
{
	int n = 0, c = gc();
	if (c == '-') {	c = gc();
		do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
		return -n;
	}
	do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

int y[100005];
long long s[100005];
int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }

int main()
{
	int i, n, N, f1, f2, m1, m2;
	long long a, ans;
	
	N = in(), n = N-1;
	for (i = 0; i < N; i++) y[i] = in();
	qsort(y, N, sizeof(int), cmp);
	if (y[0] == y[n]) { puts("1"); return 0; }
	if (N == 2) { puts("0"); return 0; }
	
	s[0] = 0; for (i = 0; i < N; i++) s[i+1] = s[i] + y[i];  // 累積和
	f1 = 1, f2 = n & 1, m2 = N>>1;
	if (f2) ans = s[1] - (s[m2]+s[m2+1]);
	else    ans = s[1] - (s[m2+1]<<1);
	
	for (i = 2; i < n; i++) {
		f1 = !f1, f2 = !f2;
		m1 = (i-1)>>1, m2 = (n+i)>>1;
		if (f1) {
			if (f2) a = (s[i]<<1) - (s[m1]+s[m1+1]+s[m2]+s[m2+1]);
			else    a = (s[i]<<1) - (s[m1]+s[m1+1]+(s[m2+1]<<1));
		} else {
			if (f2) a = (s[i]<<1) - ((s[m1+1]<<1)+s[m2]+s[m2+1]);
			else    a = (s[i]<<1) - ((s[m1+1]<<1)+(s[m2+1]<<1));
		}
		if (a < ans) ans = a;
	}

	m1 = (n-1)>>1;
	if (f1) a = s[n]-((s[m1+1]<<1)+s[N]);
	else    a = s[n]-(s[m1+1]+s[m1]+s[N]);
	if (a < ans) ans = a;
	
	printf("%lld\n", ans+s[N]);
	return 0;
}