#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int N;cin>>N;
    vl S(N),rui(N+1);
    for(int i=0;i<N;i++){
        cin>>S[i];
    }
    sort(all(S));
    for(int i=0;i<N;i++){
        rui[i+1]=rui[i]+S[i];
    }
    
    ll ans=0;
    
    for(int i=0;i<N;i++){
        int l=0,r=min(N-1-i,i)+1;
        while(r-l>1){
            int m=(l+r)/2;
            if(S[i-m]+S[N-1-m]>=S[i]*2) l=m;
            else r=m;
        }
        chmax(ans,rui[N]-rui[N-l]+rui[i+1]-rui[i-l]-(2*l+1)*S[i]);
    }
    
    for(int i=0;i<N-1;i++){
        int l=0,r=min(N-1-(i+1),i)+1;
        while(r-l>1){
            int m=(l+r)/2;
            if(S[i-m]+S[N-1-m]>=S[i]+S[i+1]) l=m;
            else r=m;
        }
        chmax(ans,rui[N]-rui[N-l]+rui[i+2]-rui[i-l]-(2*l+2)/2*(S[i]+S[i+1]));
    }
    cout<<ans<<endl;
}