#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v  x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v  x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v))  //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a<b)swap(a,b);if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}//saisyo kobaisu
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=1e18+7;
const ll MOD=1e9+7;
#define out(a) cout<<fixed<<setprecision((a))

vector<ll> minc(ll n,vector<ll> y){
	vector<ll> sum(n,y[0]),minc(n,0);
	for(int i=1;i<n;i++)sum[i] = sum[i-1] + y[i];
	int i = 0;
	for(int j=1;j<n;j++){
		ll ci = (i+1)*y[i]-sum[i] + ((sum[j]-sum[i])-y[i]*(j-i));
		i++;
		ll cip = (i+1)*y[i]-sum[i] + ((sum[j]-sum[i])-y[i]*(j-i));
		i--;
		while((i<j)&&(ci>=cip)){
			i++;
			ci = cip;
			if(i==j)break;
			i++;
			cip = (i+1)*y[i]-sum[i] + ((sum[j]-sum[i])-y[i]*(j-i));
			i--;
		}
		minc[j] = ci;
	}
	return minc;
}
vector<ll> mincr(ll n,vector<ll> y){
	vector<ll> sum(n,y[n-1]),minc(n,0);
	for(int i=n-2;i>=0;i--)sum[i] = sum[i+1] + y[i];
	int i = n-1;
	for(int j=n-2;j>=0;j--){
		ll ci = sum[i]-(n-i)*y[i] + (i-j)*y[i]-(sum[j]-sum[i]);
		i--;
		ll cip = sum[i]-(n-i)*y[i] + (i-j)*y[i]-(sum[j]-sum[i]);
		i++;
		while((i>j)&&(ci>=cip)){
			i--;
			ci = cip;
			if(i==j)break;
			i--;
			cip = sum[i]-(n-i)*y[i] + (i-j)*y[i]-(sum[j]-sum[i]);
			i++;
		}
		minc[j] = ci;
	}
	return minc;
}


int main(){
	ll N;
	cin >> N;
	vector<ll> Y(N),minf,minr;
	FOR(i,0,N)cin>>Y[i];
	SORT(Y);
	if(Y[0]==Y[N-1]){
		cout << 1 << endl;
		return 0;
	}
	minf = minc(N,Y);
	minr = mincr(N,Y);
	ll ans = INF;
	FOR(i,1,N){
		ans = min(ans,minf[i-1]+minr[i]);
	}
	cout << ans << endl;
}