#include <bits/stdc++.h>
#define rep(i, n) for(long long i = 0; i < (long long)(n); i++)
using namespace std;
using ll = long long;

int main(){
    int n;
    cin >> n;
    vector<int> v(n);
    rep(i, n){
        cin >> v[i];
    } 

    bool flag = true;
    rep(i, n-1) if(v[i] != v[i+1]) flag = false;
    if(flag){
        cout << "1" << endl;
        return 0;
    }

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

    //for(auto x : v) cout << "v: " << x << endl;

    ll ans = 1e18;

    if(n%2 == 0){
        int R = (n-1) / 2;
        vector<int> a;
        a.push_back(v[R/2]);
        a.push_back(v[R + R/2 +1]);

        //cout << "a: " << a[0] << ", " << a[1] << endl;
        
        ll sum  = 0;
        rep(j, n) sum += min(abs(v[j] - a[0]), abs(v[j] - a[1]));
        ans = min(ans, sum);
        
    }
    else {
        int R = n/2;
        vector<int> a, b;

        //cout << "a: " << v[R/2] << ", " << v[n/2 + R/2 + 1] << endl;

        ll sum  = 0;
        rep(i, n) sum += min(abs(v[i] - v[R/2]), abs(v[i] - v[n/2 + R/2 + 1]));
        ans = sum;
    }

    cout << ans << endl;
    
}