#include <bits/stdc++.h>
#define ll long long
using namespace std;

ll y[100001], d[100001];
int main(){
	int n; cin>>n;
	for(int i=0;i<n;i++) cin>>y[i];
	if(n==1){
		cout<<0<<endl;
		return 0;
	}
	sort(y, y+n);
	ll t=0;
	for(int i=0;i<n-1;i++){
		t += y[i] - y[i/2];
		d[i] += t;
	}
	t=0;
	for(int i=n-2;i>=0;i--){
		t += y[n-(n-i)/2] - y[i+1];
		d[i] += t;
	}
	ll m=1e18;
	for(int i=0;i<n-1;i++) m=min(m,d[i]);
	cout<<m<<endl;
	return 0;
}