#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);

#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a = (a<MOD)?a:(a-MOD);
	b = (b<MOD)?b:(b-MOD);
	a += b;
	a = (a<MOD)?a:(a-MOD);
}

ll s[225816],a[225816];

int main(void){
	int n,i,l,r,m;
	ll tmp,ans=0ll;
	cin >> n;
	for(i=0; i<n; ++i){
		cin >> a[i];
	}
	sort(a,a+n);
	for(i=0; i<n; ++i){
		s[i+1] = s[i]+a[i];
	}
	for(i=1; i<n; ++i){
		l = max(-1,i*2-n-1); r = i-1;
		if(a[n-1]+a[r]-(a[i]*2)<0ll){
			continue;
		}
		while(r-l>1){
			m = (l+r)/2;
			if(a[n-(i-m)]+a[m]-a[i]*2>0ll){
				r = m;
			}else{
				l = m;
			}
		}
		tmp = s[n]-s[n-(i-r)]+s[i]-s[r]-a[i]*(i-r)*2;
		ans = max(ans,tmp);
	}
	cout << ans << endl;
	return 0;
}