//
// Created by yamunaku on 2020/01/17.
//

#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD9 998244353
#define MOD1 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
#define SP <<" "<<
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
#define CFS cin.tie(0);ios::sync_with_stdio(false)
#define CST(x) cout<<fixed<<setprecision(x)

using ll = long long;
using ld = long double;
using vi = vector<int>;
using mti = vector<vector<int>>;
using vl = vector<ll>;
using mtl = vector<vector<ll>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template<typename T>
using heap = priority_queue<T, vector<T>, function<bool(const T, const T)>>;

int main(){
    // CFS;
    int n;
    cin >> n;
    vi a(n);
    rep(i, n){
        cin >> a[i];
    }
    sort(all(a));
    ll ans = 0;
    vl rui(n + 1, 0);
    rep(i, n) rui[i + 1] = rui[i] + a[i];
    repl(i, 1, n - 1){
        int l = 1, r = min(i, n - i - 1) + 1;
        while(r - l > 1){
            int mid = (l + r) / 2;
            if(a[n - mid] + a[i - mid] >= 2 * a[i]){
                l = mid;
            }else{
                r = mid;
            }
        }
        ans = max(ans, rui[n] - rui[n - l] + rui[i] - rui[i - l] - (2 * l) * a[i]);
    }
    cout << ans << endl;
    return 0;
}