#include <bits/stdc++.h>
using namespace std;

using ll = long long;

ll diffSum(vector<ll>& y, ll p) {
  ll ret = 0;
  for (ll a : y) ret += abs(a - p);
  return ret;
}

int N;
ll ans;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin >> N;

  vector<ll> Y(N);

  for (int i = 0; i < N; ++i) cin >> Y[i];

  sort(Y.begin(), Y.end());

  ll l = Y[0], r = Y[N - 1] + 1, m = (r + l) / 2, ml, mr, tmpl, tmpr, tmpm;

  while (r - l > 1) {
    ml = (l + m) / 2;
    mr = (m + r) / 2;

    tmpl = diffSum(Y, ml);
    tmpr = diffSum(Y, mr);
    tmpm = diffSum(Y, m);

    ll min_ = min({tmpl, tmpr, tmpm});

    if (min_ == tmpm) l = ml, r = mr;
    else if (min_ == tmpl) r = m;
    else l = m;
    m = (l + r) / 2;
  }

  ans = min(diffSum(Y, l), diffSum(Y, r));

  cout << ans << endl;

  return 0;
}