/*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N;
    cin >> N;
    ll a[200010];
    rep(i,0,N) cin >> a[i];
    sort(a, a+N);
    // printa(a, N);
    if(N == 1 || N == 2){
        print(0);
        return 0;
    }
    ll ans = 0;
    ll sum[200010] = {};
    rep(i,0,N) sum[i+1] = sum[i] + a[i];
    rep(i,1,N-1){
        ll res = 0;
        ll v1 = i, v2 = N - i - 1;
        ll v = min(i, N-i-1);
        ll lv = 0, rv = v+1;
        while(rv - lv > 1){
            ll mid = (rv + lv) / 2;
            bool ok = true;
            if(a[i-mid] + a[N-mid] - 2 * a[i] <= 0){
                ok = false;
            }
            if(ok){
                lv = mid;
            }else{
                rv = mid;
            }
        }
        res = (sum[i] - sum[i-lv]) + (sum[N] - sum[N-lv]) - 2 * lv * a[i];
        // print(i,lv, res);
        // print(res);
        ans = max(ans, res);
    }
    print(ans);

    

}