#include <bits/stdc++.h>
using namespace std;
const int maxn = 2 << 17;
int n;
long a[maxn];
long s[maxn + 1];
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);
    for (int i = 0; i < n; i++) s[i + 1] = s[i] + a[i];
    long ans = 0;
    for (int i = 0; i < n; i++) {
        int maxlen = min(i, n - i - 1);
        auto check = [&](int idx) -> bool { return a[i - idx] + a[n - idx] >= 2 * a[i]; };
        int tv = 0, fv = maxlen + 1;
        while (fv - tv > 1) {
            int mv = (fv + tv) / 2;
            (check(mv) ? tv : fv) = mv;
        }
        ans = max(ans, s[n] - s[n - tv] + s[i] - s[i - tv] - a[i] * 2 * tv);
    }
    cout << ans << "\n";
}