/*** 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);
    if(N == 1 || N == 2){
        print(0);
        return 0;
    }
    ll ans = 0;
    rep(i,1,N-1){
        ll res = 0;
        ll lv = i, rv = N - i - 1;
        rep(j,0,min(lv,rv)){
            if(a[i-j-1] + a[N-1-j] - 2 * a[i] > 0){

                res += a[i-j-1] + a[N-1-j] - 2 * a[i];
            }else{
                break;
            }
        }
        ans = max(ans, res);
    }
    print(ans);

    

}