#include "bits/stdc++.h" using namespace std; using ll = long long; using pii = pair; using pll = pair; using vi = vector; using vl = vector; using vvi = vector; using vvl = vector; const int INF = 1 << 28; const ll MOD = 1000000007; template bool chmax(T &a, const T &b) { return (a < b) ? (a = b, 1) : 0; } template bool chmin(T &a, const T &b) { return (b < a) ? (a = b, 1) : 0; } int main() { int n; cin >> n; vl y(n); for (int i = 0; i < n; ++i) { cin >> y[i]; } sort(y.begin(), y.end()); if (y[0] == y[n - 1]) { cout << 1 << "\n"; return 0; } vl z = y; for (int i = 1; i < n; ++i) { z[i] += z[i - 1]; } ll ret = 1LL << 60; for (int i = 1; i < n; ++i) { int xs = 0; int xm = i / 2; int xt = i; int ys = i; int ym = i + (n - i) / 2; int yt = n; ll leftmode = y[xm]; ll rightmode = y[ym]; ll leftleft = leftmode * (xm + 1) - z[xm]; ll leftright = (z[xt - 1] - z[xm]) - (xt - 1 - xm) * leftmode; ll left = leftleft + leftright; ll rightleft = rightmode * (ym - ys + 1) - (z[ym] - z[ys - 1]); ll rightright = (z[yt - 1] - z[ym]) - (yt - 1 - ym) * rightmode; ll right = rightleft + rightright; chmin(ret, left + right); } cout << ret << "\n"; return 0; }