#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;

int main(){
    int n;
    cin >> n;
    vl a(n);
    rep(i, n) cin >> a[i];
    sort(all(a));
    auto calc = [&] (ll k) {
        ll ret = 0LL;
        rep(i, n) ret += abs(a[i] - k);
        return ret;
    };
    ll ans = 1e18;
    rep(i, 10) {
        ans = min(ans, calc(a[min(n-1, n/2+i)]));
        ans = min(ans, calc(a[max(0, n/2-i)]));
    }
    cout << ans << endl;
    return 0;
}