#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());

    ll ans = 0, sumR = 0, sumL = 0;
    for (int i = 1; i < n; ++i) {
        if (i * 2 + 1 > n) break;
        sumR += a[n - i];
        sumL += a[i - 1];
        ans = max(ans, sumR + sumL - a[i] * 2 * i);
    }
    cout << ans << "\n";
    return 0;
}