#include <iostream>
#include <algorithm>
#define llint long long
#define inf 1e18

using namespace std;

llint n;
llint a[200005], sum[200005];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> a[i], a[i] *= 2;
	sort(a+1, a+n+1);
	
	if(n <= 2){
		cout << 0 << endl;
		return 0;
	}
	for(int i = 1; i <= n; i++) sum[i] = sum[i-1] + a[i];
	
	llint ans = 0;
	for(llint i = 2; i <= n-1; i++){
		llint m = a[i];
		llint ub = min(n-i, i-1)+1, lb = 0, mid;
		while(ub-lb>1){
			mid = (ub+lb)/2;
			if(a[n-mid+1] + a[i-mid] > 2*m) lb = mid;
			else ub = mid;
		}
		llint tmp = sum[n]-sum[n-lb] + sum[i]-sum[i-lb-1] - m*(2*lb+1);
		//cout << i << " " << m << " " << lb << " " << tmp << endl;
		ans = max(ans, tmp);
	}
	for(llint i = 2; i <= n-2; i++){
		llint m = (a[i]+a[i+1])/2;
		llint ub = min(n-(i+1), i-1)+1, lb = 0, mid;
		while(ub-lb>1){
			mid = (ub+lb)/2;
			if(a[n-mid+1] + a[i-mid] > 2*m) lb = mid;
			else ub = mid;
		}
		llint tmp = sum[n]-sum[n-lb] + sum[i+1]-sum[i-lb-1] - m*(2*lb+2);
		ans = max(ans, tmp);
	}
	cout << ans / 2 << endl;
	
	return 0;
}