#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 lb = ll(1e9), rb = -ll(1e9), mid;

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], lb = min(lb, Y[i]), rb = max(rb, Y[i]);

  ll ans = diffSum(Y, lb);

  while (rb - lb > 1) {
    mid = (lb + rb) / 2;
    ll tmp = diffSum(Y, mid);

    if (ans < tmp) {
      rb = mid;
    }
    else {
      lb = mid;
      ans = tmp;
    }
  }

  ans = min({ans, diffSum(Y, lb), diffSum(Y, rb)});

  cout << ans << endl;

  return 0;
}