#include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>

using namespace std;

using ll = long long;
using P = pair<int, int>;

const long long MOD = 1e9+7;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int main() { 
    int n;
    cin >> n;
    vector<ll> y(n);
    for (int i = 0; i < n; i++) {
        cin >> y.at(i);
    }    
    sort(y.begin(), y.end());
    
    if (y.at(0) == y.at(n - 1)) {
        cout << 1 << endl;
        return 0;
    }
    
    vector<ll> sum(n + 1);
    for (int i = 0; i < n; i++) {
        sum.at(i + 1) = sum.at(i) + y.at(i);
    }
    //[l, r)
    auto range_sum = [&](int l, int r){ return sum.at(r) - sum.at(l); };

    auto sum_dist = [&](int l, int r){
        int m = (l + r) / 2;
        ll res = y.at(m) * (m - l) - range_sum(l, m) - y.at(m) * (r - m) + range_sum(m, r);
        return res;
    };
    
    ll mini = 1e18;
    for (int p = 1; p < n; p++) {
        chmin(mini, sum_dist(0, p) + sum_dist(p, n));
    }
    cout << mini << endl;
}