#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    int n;cin>>n;
    vector<ll> a(n);
    rep(i,n) cin>>a[i];
    sort(ALL(a));
    vector<ll> sum(n+1);sum[0]=0;
    rep(i,n) sum[i+1]=sum[i]+a[i];
    if(a[0]==a[n-1]){
        cout<<1<<endl;
        return 0;
    }
    ll ans=LINF;
    rep(i,n-1){
        // [0,i],[i+1,n-1]
        ll lc,rc;
        {
            int mid=i/2;ll k=a[mid];
            lc=k*mid-sum[mid]+(sum[i+1]-sum[mid+1])-k*(i-mid);
        }
        {
            int mid=(i+1+n-1)/2;ll k=a[mid];
            rc=k*(mid-i-1)-(sum[mid]-sum[i+1])+sum[n]-sum[mid+1]-k*(n-1-mid);
        }
        // cout<<"["<<0<<","<<i<<"], ["<<i+1<<","<<"]"<<endl;
        // cout<<lc<<" + "<<rc<<" = "<<lc+rc<<endl;
        chmin(ans,lc+rc);
    }
    cout<<ans<<endl;
    return 0;
}