#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define ALL(x) begin(x), end(x)
using ll = long long;
using namespace std;
template <class T, class U> inline void chmin(T & a, U const & b) { a = min<T>(a, b); }

ll solve(int n, vector<ll> & a) {
    sort(ALL(a));
    if (a.front() == a.back()) {
        return 1;
    }
    vector<ll> acc(n + 1);
    partial_sum(ALL(a), acc.begin() + 1);

    ll ans = LLONG_MAX;
    REP3 (m, 1, n) {
        ll sum = 0;
        int i = upper_bound(a.begin(), a.begin() + m, a[m / 2]) - a.begin();
        sum += i * a[m / 2] - (acc[i] - acc[0]);
        sum += (acc[m] - acc[i]) - (m - i) * a[m / 2];
        int j = upper_bound(a.begin() + m, a.end(), a[m + (n - m) / 2]) - a.begin();
        sum += (j - m) * a[m + (n - m) / 2] - (acc[j] - acc[m]);
        sum += (acc[n] - acc[j]) - (n - j) * a[m + (n - m) / 2];
        chmin(ans, sum);
    }
    return ans;
}

int main() {
    int n; scanf("%d", &n);
    vector<ll> a(n);
    REP (i, n) {
        scanf("%lld", &a[i]);
    }
    printf("%lld\n", solve(n, a));
    return 0;
}