#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

int main() {
    int n; cin >> n;
    vector<ll> a(n);
    for (ll &ai: a) cin >> ai;
    sort(a.begin(), a.end());
    if (a[0] == a[n - 1]) {
        cout << 1 << endl;
        return 0;
    }
    vector<ll> acc(n + 1);
    for (int i = 0; i < n; i++) acc[i + 1] = acc[i] + a[i];
    ll ans = 1LL << 60;
    for (int i = 0; i < n; i++) {
        int m1 = i / 2;
        int m2 = (n + i) / 2;
        ll s1 = a[m1] * m1 - acc[m1];
        ll s2 = (acc[i] - acc[m1]) - a[m1] * (i - m1);
        ll s3 = a[m2] * (m2 - i) - (acc[m2] - acc[i]);
        ll s4 = (acc[n] - acc[m2]) - a[m2] * (n - m2);
        ans = min(ans, s1 + s2 + s3 + s4);
    }
    cout << ans << endl;
    return 0;
}