#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<ll> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    sort(a.begin(), a.end());

    vector<ll> sum(n + 1, 0);
    for (int i = 0; i < n; ++i) {
        sum[i + 1] = sum[i] + a[i];
    }

    ll ans = 0, sumR = 0, sumL = 0;
    for (int i = 0; i < n; ++i) {
        int ok = 0, ng = min(i, n - 1 - i) + 1;
        while (ng - ok > 1) {
            int mid = (ok + ng) / 2;
            if (a[n - mid] + a[i - mid] >= a[i] * 2) ok = mid;
            else ng = mid;
        }
        //cerr << i << " " << ok << " " << sum[n] - sum[n - ok] + sum[i] - sum[i - ok] - a[i] * ok * 2 << endl;
        ans = max(ans, sum[n] - sum[n - ok] + sum[i] - sum[i - ok] - a[i] * ok * 2);
    }
    cout << ans << "\n";
    return 0;
}