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

int main(){
    ios::sync_with_stdio(false);
	cin.tie(0);
    
    ll n;
    cin>>n;
    ll y[n];
    ll m = 0;
    bool same = true;
    bool k;
    for(int i=0;i<n;i++){
        cin>>y[i];
        m = min(m,y[i]);
        if(!i) k=y[i];
        else if(k!=y[i]) same = false;
    }
    if(same){
        cout<<1<<endl;
        return 0;
    }
    sort(y,y+n);
    ll ans = 1e18;
    ll sum[n+1]={};
    for(int i=0;i<n;i++){
        y[i] -= m;
        sum[i+1] = sum[i] + y[i];
    }

    for(int i=0;i<n;i++){
        ll ret = 0;
        ll d = (i+0)/2;
        ll u = (n+i)/2;
        ret += y[d]*d - sum[d] + sum[i]-sum[d] - y[d]*(i-d);
        //cerr<<i<<" "<<ret<<endl;
        ret += y[u]*(u-i) - sum[u]+sum[i] + sum[n]-sum[u] - y[u]*(n-u);
        ans = min(ret,ans);
        //cerr << i <<" "<<d<<" "<<u<<" "<<ret<<endl;
    }
    cout << ans << endl;
}