#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;}

ll solve(deque<ll> v){
    int n=(int)v.size();
    vector<ll> sum(n+1,0);
    rep(i,n) sum[i+1]=sum[i]+v[i];
    ll ret=LINF;
    rep(i,n){
        ll res=-sum[i]+i*v[i]+(sum[n]-sum[i+1])-(n-1-i)*v[i];
        chmin(ret,res);
    }
    return ret;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int n;cin>>n;
    vector<ll> v(n);
    rep(i,n) cin>>v[i];
    sort(ALL(v));
    if(v[0]==v[n-1]){
        cout<<1<<endl;
        return 0;
    }
    deque<ll> l,r;
    l.push_back(v[0]);
    for(int i=1;i<n;i++) r.push_back(v[i]);
    ll ans=LINF;
    while(r.size()>0){
        chmin(ans,solve(l)+solve(r));
        l.push_back(r.front());
        r.pop_front();
    }
    cout<<ans<<endl;
    return 0;
}