// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll LINF = 1001001001001001LL;
const ll MOD = 1000000007LL;
 
int main() {
    int64 N; cin >> N;
    vector<int64> Y(N), sum(N+1);
    for(int i=0; i<N; i++) cin >> Y[i];
    sort(Y.begin(), Y.end());

    if(Y[0] == Y[N-1]) {
        cout << 1 << endl;
        return 0;
    }
    else {
        int64 ans = LINF;
        for(int i=0; i<N; i++) sum[i+1] = sum[i] + Y[i];
        for(int i=1; i<N; i++) {
            int64 cand = 0;
            // [1, i]
            {
                int64 mid = (1 + i) / 2 - 1;
                int64 h = Y[mid];
                int64 sumL = sum[mid];
                int64 sumR = sum[i] - sum[mid];

                int64 vl = mid, vr = i - vl;
                cand += vl * h - sumL;
                cand += sumR - vr * h;

                // fprintf(stderr, "i = %d: mid = %lld, h = %lld, vl = %lld, vr = %lld, sumL = %lld, sumR = %lld\n", i, mid, h, vl, vr, sumL, sumR);
            }

            // [i+1, N]
            {
                int64 mid = (i + 1 + N) / 2 - 1;
                int64 h = Y[mid];
                int64 sumL = sum[mid] - sum[i];
                int64 sumR = sum[N] - sum[mid];

                int64 vl = mid - i, vr = N - i - vl;
                cand += vl * h - sumL;
                cand += sumR - vr * h;
            }
            chmin(ans, cand);
        }
        cout << ans << endl;
    }
    return 0;
}