#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N; cin >> N;
    vector<ll> A(N);
    rep(i,N) cin >> A[i];

    sort(A.begin(), A.end());
    ll sz = set<ll>(A.begin(), A.end()).size();
    if(sz == 1) {
        cout << 1 << endl;
        return 0;
    }

    vector<ll> S(N + 1, 0);
    rep(i,N) S[i + 1] += S[i] + A[i];
    ll ans = 1e18;
    rep(i,N-1) {
        ll L = i / 2, R = i + (N - i) / 2;
        ll cost = 0;
        cost += A[L] * L - S[L];
        cost += S[i + 1] - S[L + 1] - A[L] * (i - L);
        cost += A[R] * (R - 1 - i) - (S[R] - S[i + 1]);
        cost += S[N] - S[R + 1] - A[R] * (N - 1 - R);
        ans = min(ans, cost);
    }
    cout << ans << endl;
}