#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;
 
int main(){
    int N;cin>>N;
    vector<int> a(N);
    REP(i, N) cin >> a[i];
    sort(All(a));
    vector<ll> S(N+1);
    REP(i,N) S[i+1]=S[i]+a[i];
    ll ans=0;
    REP(i,N){
        int l=0,r=N;
        while(l+1<r){
            int mid=(l+r)>>1;
            if(i-mid<0){
                r=mid;
                continue;
            }
            if(a[N-mid]>=a[i-mid]) l=mid;
            else r=mid;
        }
        ans=max(ans,S[N]-S[N-l]+(S[i]-S[i-l])-(2*l+1)*a[i]);
        if(i<N-1) ans=max(ans,S[N]-S[N-l-1]+(S[i+1]-S[i-l])-(l+1)*(a[i]+a[N-l-1]));
        if(i>0) ans=max(ans,S[N]-S[N-l]+(S[i]-S[i-l-1]-(l+1)*(a[i]+a[i-1])));
    }
    cout<<ans<<endl;
}