#pragma comment (linker, "/STACK:256000000")
#define  _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()
void init() {
	iostream::sync_with_stdio(false);
	cout << fixed << setprecision(100);
}
#define int ll
ll summing[300000];
ll calc_sum(ll a, ll b) {
	return summing[b+1] - summing[a];
}
void solve() {
	int n;
	cin >> n;
	vector<ll> inputs;
	REP(i, n) {
		int a;
		cin >> a;
		inputs.pb(a);
	}
	sort(ALL(inputs));
	reverse(ALL(inputs));
	ll ans = 0;
	for (int i = 0; i < inputs.size(); ++i) {
		summing[i + 1] = summing[i] + inputs[i];
	}
	for (int i = inputs.size(); i+1 < inputs.size()+20; ++i) {
		summing[i + 1] = summing[i];
	}
	//mid point
	for (int i = 1; i+1 < (long long)inputs.size(); ++i) {
		ll bot = 0;
		ll top = min(i, (long long)inputs.size() - (i + 1LL));
		while (top - bot > 1) {
			ll mid = (top + bot) / 2LL;
			if (inputs[mid] + inputs[mid + i + 1] >= 2LL * inputs[i]) {
				bot = mid;
			}
			else {
				top = mid;
			}
		}
		ans = max(ans,(calc_sum(0, bot) + calc_sum(i + 1, bot + i + 1)) - inputs[i] * ((bot+1LL) * 2LL));
	}
	cout << ans << endl;
}

#undef int

int main() {
	init();
	solve();
}