#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
#define uniq(v) (v).erase(unique(all(v)), (v).end())

using namespace std;

using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, const vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }

void solve() {
  int n; cin >> n;
  vi64 y(n); cin >> y;
  sort(all(y));
  if (y[0] == y[n - 1]) {
    cout << 1 << '\n';
    return;
  }
  {
    unordered_set<i64> s;
    rep(i, n) s.insert(y[i]);
    if (s.size() == 2) {
      cout << 0 << '\n';
      return;
    }
  }
  int li = 0, ri = (n + 1) / 2;
  i64 ltotal = 0, rtotal = 0;
  {
    reps(i, n - 1) {
      rtotal += abs(y[ri] - y[i]);
    }
  }
  i64 ans = ltotal + rtotal;

  repic(i, 1, n - 2) {
    ltotal += y[i] - y[li];
    rtotal -= y[ri] - y[i];
    int ll = i / 2, rr = (n - i - 2) / 2 + i + 1;

    if (li < ll && y[li] < y[ll]) {
      i64 lc = lower_bound(all(y), y[ll]) - y.begin();
      i64 rc = i - (lower_bound(all(y), y[li]) - y.begin());

      ltotal += (lc - rc) * (y[ll] - y[li]);
    }

    if (ri < rr && y[ri] < y[rr]) {
      i64 lc = (lower_bound(all(y), y[rr]) - y.begin()) - i - 1;
      i64 rc = y.end() - lower_bound(all(y), y[ri]) - 1;

      rtotal += (lc - rc) * (y[rr] - y[ri]);
    }

    li = ll;
    ri = rr;
    amin(ans, ltotal + rtotal);
  }
  cout << ans << '\n';
}