#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);

#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a = (a<MOD)?a:(a-MOD);
	b = (b<MOD)?b:(b-MOD);
	a += b;
	a = (a<MOD)?a:(a-MOD);
}

ll a[100100],s[100100];

ll f(int l, int r){
	int p;
	ll ret = 0ll;
	if(r-l==0){
		return 0ll;
	}else if(r-l==1){
		return (a[r-1]-a[l-1]);
	}
	p = (l+r)/2;
	if(((r-l)%2)){
		ret += (s[r]-s[p]);
		ret -= (s[p]-s[l-1]);
	}else{
		ret += (s[r]-s[p]);
		ret -= (s[p-1]-s[l-1]);
	}
	return ret;
}

int main(void){
	int n,i,p;
	ll ans=INFLL;
	cin >> n;
	for(i=0; i<n; ++i){
		cin >> a[i];
	}
	sort(a,a+n);
	if(a[0]==a[n-1]){
		cout << 1 << endl;
		return 0;
	}
	for(i=0; i<n; ++i){
		s[i+1] = a[i]+s[i];
	}
	for(i=1; i<n; ++i){
		ans = min(ans,f(1,i)+f(i+1,n));
	}
	cout << ans << endl;
	return 0;
}