#include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using i64=int_fast64_t;

int n;
i64 hei[1<<17];
i64 hsum[1<<17];
const i64 inf=1e18;

//for [l,r]
i64 calc(int l,int r) {
    return hei[r+1]-hei[l];
}

int main() {
    cin>>n;
    for(int i=0; i<n; ++i) cin>>hei[i];
    sort(hei,hei+n);
    if(hei[0]==hei[n-1]) {
        cout<<1<<endl;
        return 0;
    }

    for(int i=0; i<n; ++i) {
        hsum[i+1]=hsum[i]+hei[i];
    }

    i64 ans=inf;
    for(int i=1; i<n; ++i) {
        i64 ll=0,rr=0;
        pii lmid,rmid;

        //left part
        {
            int l=(i-1)/2;
            if(i&1) {
                lmid={hei[l],hei[l]};
                ll+=hsum[i]-hsum[l+1]-hsum[l];
            } else {
                lmid={hei[l],hei[l+1]};
                ll+=hsum[i]-hsum[l+1]*2;
            }
        }

        //right part
        {
            int r=(n-1+i)/2;
            if((n-i)&1) {
                rmid={hei[r],hei[r]};
                rr+=hsum[n]-hsum[r+1]-(hsum[r]-hsum[i]);
            } else {
                rmid={hei[r],hei[r+1]};
                rr+=hsum[n]-hsum[r+1]-(hsum[r+1]-hsum[i]);
            }
        }

        if(lmid.first!=rmid.second) {
            ans=min(ans,ll+rr);
        }
    }
    cout<<ans<<endl;
}