#include <bits/stdc++.h>

using namespace std;

const int MAX = 1e6 + 10;
int n;
long long y[MAX];

inline long long calc(long long align) {
  long long ret = 0;
  for (int i = 0; i < n; i++) {
    ret += llabs(y[i] - align);
  }
  return ret;
}

int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%lld", y + i);
  }
  long long low = -1e9 + 1, high = 1e9 + 1;
  while (high - low > 5) {
    const long long mid1 = (low * 2 + high) / 3;
    const long long mid2 = (low + high * 2) / 3;
    if (calc(mid1) <= calc(mid2)) {
      high = mid2;
    } else {
      low = mid1;
    }
  }
  long long ans = 1e18;
  for (long long i = low; i <= high; i++) {
    ans = min(ans, calc(i));
  }
  printf("%lld\n", ans);
  return 0;
}