#include <bits/stdc++.h>
#define FI first
#define SE second
#define PB push_back
#define ll long long
#define FOR(i,a,b) for(int i=a;i<b;++i)
#define ROF(i,a,b) for(int i=b-1;i>=a;--i)
#define YES(i) cout<<(i?"YES":"NO")<<endl
#define Yes(i) cout<<(i?"Yes":"No")<<endl
#define co(i) cout<<(i)<<endl
#define fcout cout<<fixed<<setprecision(10)
#define uni(i) i.erase(unique(i.begin(), i.end()), i.end());
#define all(i) i.begin(),i.end()
#define pint pair<int, int>
#define vint vector<int>
using namespace std;

const int INF=1e9+7;
const ll LINF=1e18;
const int MOD=1e9+7;
//const int MOD=998244353;

ll y[100000],d[100000];
int main(){
	int n; cin>>n;
	assert(n>=2 && n<=100000);
	FOR(i,0,n){
		cin>>y[i];
		assert(-1e9<=y[i] && y[i]<=1e9);
	}
	sort(y,y+n);
	if(y[0]==y[n-1]){
		co(1); return 0;
	}
	ll t=0;
	FOR(i,0,n-1){
		t+=y[i]-y[i/2];
		d[i]+=t;
	}
	t=0;
	ROF(i,0,n-1){
		t+=y[n-(n-i)/2]-y[i+1];
		d[i]+=t;
	}
	ll m=LINF;
	FOR(i,0,n-1) m=min(m,d[i]);
	co(m);
	return 0;
}