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

using ll = long long;

ll Y[100000], N;

ll dif(int x) {
    ll sum1 = 0;
    rep(i, x) sum1 += Y[i];
    ll mean1 = sum1 / x;
    if ((sum1 - mean1 * x) * 2 >= x) mean1++;
    ll sum2 = 0;
    rep(i, N - x) sum2 += Y[i + x];
    ll mean2 = sum2 / (N - x);
    if ((sum2 - mean2 * (N - x)) * 2 >= N - x) mean2++;
    ll ret = 0;
    rep(i, x) ret += abs(Y[i] - mean1);
    rep(i, N - x) ret += abs(Y[i + x] - mean2);
    return ret;
}

ll solve() {
    if (Y[0] == Y[N - 1]) return 1;
    int l = 1, r = N - 1;
    while (l < r - 1) {
        int m = (l + r) / 2;
        if (dif(m - 1) <= dif(m)) r = m;
        else l = m;
    }
    return min(dif(l), dif(r));
}

int main() {
    cin >> N;
    rep(i, N) cin >> Y[i];
    sort(Y, Y + N);
    cout << solve() << endl;
}