#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define inf (int)(1e9+7)
#define mod (int)(1e9+7)
#define INF (ll)(1e18)
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<typename T> T pow(T a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }



int n, m;
vector<int> a;

bool check(int x) {
    int i = n - x;
    int j = m - x;
    // cout << x << " " << i << " " << j << endl;
    if (j < 0 || i >= n) return 0;
    // cout << 1LL * a[i] + a[j] - 2 * a[m] << endl;
    if (1LL * a[i] + a[j] - 2 * a[m] > 0) return 1;
    
    return 0;
}

template<typename T>
int binary_search(T ok, T ng) {
    while (abs(ng - ok) > 1) {
        T mid = (ng + ok) / 2;
        (check(mid) ? ok : ng) = mid;
    }
    return ok;
}


void solve() {
    cin >> n;
    a.resize(n);
    rep(i, n) cin >> a[i];
    sort(all(a));
    
    vector<ll> acc(n + 1);
    rep(i, n) acc[i + 1] = acc[i] + a[i];
    
    ll ans = 0;
    for (m = 0; m < n; ++m) {
        int it = binary_search(0, n);
        chmax(ans, 1LL * a[m] + (acc[m] - acc[m - it]) + (acc[n] - acc[n - it]) - (2LL * it + 1) * a[m]);
    }
    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int T;
    // cin >> T;
    T = 1;
    
    while (T--) {
        solve();
    }
    
}