#include <iostream>
#include <algorithm>
#include <vector>
#define ll long long

using namespace std;

ll cosum[200005];

ll solve(const vector<int>& v, int ls, int le, int rs, int re, ll m2){
    if(le<ls || re<rs) return 0;
    
    int lb=0, ub=v.size();
    while(ub-lb>1){
        int mid = (lb+ub)/2;
        
        bool check = false;
        if(le-mid+1<ls || re-mid+1<rs) check = false;
        else {
            if(v[le-mid+1] + v[re-mid+1] - m2 >= 0) check = true;
            else check = false;
        }
        if(check) lb = mid;
        else ub = mid;
    }
    //cerr << ls << " " << le << " " << rs << " " << re << " " << lb << " : " << cosum[re] - (re-lb>=0?cosum[re-lb]:0) + cosum[le] - (le-lb>=0?cosum[le-lb]:0) - lb * m2 << endl;
    return cosum[re] - (re-lb>=0?cosum[re-lb]:0) + cosum[le] - (le-lb>=0?cosum[le-lb]:0) - lb * m2;
}


int main(){
    int N;
    cin >> N;
    vector<int> v;
    for(int i=0; i<N; i++){
        int a;
        cin >> a;
        v.push_back(a);
    }
    sort(v.begin(), v.end());

    if(N==1){
        cout << 0 << endl;
        return 0;
    }

    cosum[0] = v[0];
    for(int i=1; i<N; i++){
        cosum[i] = cosum[i-1] + v[i];
    }

    ll ret = 0;
    for(int i=0; i<N; i++){
        ret = max(ret, solve(v,0,i-1,i+1,N-1,2*v[i]));
        ret = max(ret, solve(v,0,i-1,i+2,N-1,v[i]+v[i+1]));
    }

    cout << ret << endl;

    return 0;
}