/* -*- coding: utf-8 -*-
 *
 * 609.cc: No.609 Noelちゃんと星々 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int INF = 1 << 30;

/* typedef */

typedef long long ll;
typedef long double ld;

/* global variables */

int ys[MAX_N];

/* subroutines */

ll dsum(int n, int ty) {
  ll sum = 0.0;
  for (int i = 0; i < n; i++) sum += abs(ty - ys[i]);
  return sum;
}

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n; i++) scanf("%d", &ys[i]);
  sort(ys, ys + n);

  int l = 0, r = n - 1;
  while (l + 2 < r) {
    int k0 = (l * 2 + r) / 3;
    int k1 = (l + r * 2) / 3;
    ll d0 = dsum(n, ys[k0]);
    ll d1 = dsum(n, ys[k1]);
    if (d0 >= d1) l = k0;
    else r = k1;
  }

  ll minsum = dsum(n, ys[l]);
  for (ll k = l + 1; k <= r; k++) {
    ll sum = dsum(n, ys[k]);
    if (minsum > sum) minsum = sum;
  }

  printf("%lld\n", minsum);
  return 0;
}