#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll =  long long ;
using P = pair<ll,ll> ;
const ll INF = 1e18;
const int MOD = 1000000007;

int main(){
    int n;
    cin >> n;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    sort(a.begin(),a.end());
    if(a[0] == a[n-1]){
        cout << 1 << endl;
        return 0;
    }
    vector<ll> sum(n+1);
    rep(i,n) sum[i+1] = sum[i] + a[i];
    ll ans = INF;
    for(int i=1;i<n;i++){
        ll res = 0;
        if(i%2 == 0) res += sum[i] - sum[i/2] + sum[0] - sum[i/2];
        else res += sum[i] - sum[(i+1)/2] + sum[0] - sum[i/2];

        if((n-i)%2 ==0) res += sum[n] - sum[n-(n-i)/2] + sum[i] - sum[n-(n-i)/2];
        else res += sum[n] - sum[n-(n-i)/2] + sum[i] - sum[n-(n-i)/2-1];
        ans = min(ans,res);
    }
    cout << ans << endl;
    return 0;
}