#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>
#include <time.h>
#include <random>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;

long long int INF = 3e18;
double Pi = 3.1415926535897932384626;

vector<ll> G[500005];
//vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←


#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl


ll mod = 1000000007;
ll rui(ll number1,ll number2){

    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){

    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){

    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){

    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}

//ll fact[800005],rfact[800005];
/*
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=800000; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
	rfact[800000] = rui(fact[800000],mod - 2);
	for(ll i=800000; i>=1; i--){
	   rfact[i-1] = rfact[i] * i;
	   rfact[i-1] %= mod;
	}
	return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod) * rfact[n-r]) % mod;}
*/

ll n,m,num,ans,a,b,c,d,e,g,h,w,i,j,k,q,l,r,idx;
ll x[500005],y[500005],z[500005];
char s[500005];

bool flag,dame;

ll midnum(ll left,ll right){
	return (left+right)/2;
}

ll sum(ll left,ll right){
	if(left == 0){
		return y[right];
	}else{
		return y[right] - y[left-1];
	}
}


ll midsum(ll left,ll right,ll mid){
	//[left,right]の各xについてabs(x-mid)の合計
	ll res1 = sum(mid,right) - x[mid] * (right-mid+1);
	ll res2 = x[mid] * (mid-left+1) - sum(left,mid);
	return res1 + res2;
}




int main(){
	cin >> n;
	for(i=0;i<n;i++){
		cin >> x[i];
	}
	sort(x,x+n);
	if(x[0] == x[n-1]){
		p(1);
		return 0;
	}
	for(i=0;i<n;i++){
		if(i != 0)y[i] = y[i-1] + x[i];
		else y[i] = x[i];
	}
	ans = INF;
	for(i=0;i<n-1;i++){
		ll left1,right1,left2,right2;
		left1 = 0;
		right1 = i;
		left2 = i+1;
		right2 = n-1;
		ll mid1,mid2;
		mid1 = midnum(left1,right1);
		mid2 = midnum(left2,right2);
		ans = min(ans,midsum(left1,right1,mid1)+midsum(left2,right2,mid2));
		//p(ans);
	}
	p(ans);

	return 0;
}