#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<ll> y(n);
    for (int i = 0; i < n; i++) cin >> y[i];
    sort(y.begin(), y.end());

    set<ll> s(y.begin(), y.end());
    if (s.size() == 1) {
        cout << 1 << endl;
        return 0;
    } else if (s.size() == 2) {
        cout << 0 << endl;
        return 0;
    }

    vector<ll> sum(n + 1, 0);
    for (int i = 0; i < n; i++) {
        sum[i + 1] = sum[i] + y[i];
    }

    ll ans = 1e18;
    for (int i = 0; i < n - 1; i++) {
        int idx1 = i / 2;
        ll s1 = (idx1 * y[idx1] - sum[idx1]) + sum[i + 1] - sum[idx1 + 1] - (i - idx1) * y[idx1];

        int idx2 = i + 1 + (n - 1 - i) / 2;
        ll s2 = (idx2 - 1 - i) * y[idx2] - (sum[idx2] - sum[i + 1]) + sum[n] - sum[idx2 + 1] - (n - idx2 - 1) * y[idx2];
        
        ans = min(ans, s1 + s2);
    }    
    cout << ans << endl;
    return 0;
}