#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    vector<int> ys(n);
    for (int i = 0; i < n; i++) cin >> ys[i];
    sort(ys.begin(), ys.end());
    if (ys.front() == ys.back()) {
        cout << 1 << endl;
        return 0;
    }
    vector<long long> sum(n + 1);
    for (int i = 0; i < n; i++) {
        sum[i + 1] = sum[i] + ys[i];
    }

    long long ans = 1e18;
    for (int i = 1; i < n; i++) {
        int j = n - i;
        long long le, ri;
        if (i & 1) {
            int mid = i / 2;
            long long ll = sum[mid], lr = sum[i] - sum[mid + 1];
            le = lr - ll;
        } else {
            long long ll = sum[i / 2], lr = sum[i] - sum[i / 2];
            le = lr - ll;
        }
        if (j & 1) {
            int mid = j / 2;
            long long rl = sum[i + mid] - sum[i], rr = sum[n] - sum[i + mid + 1];
            ri = rr - rl;
        } else {
            long long rl = sum[i + j / 2] - sum[i], rr = sum[n] - sum[i + j / 2];
            ri = rr - rl;
        }
        if (le + ri < ans) {
            ans = le + ri;
        }
    }
    cout << ans << endl;
}