#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;
	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=(n-1)/2; i>0; --i){
		tmp = s[i]+s[n]-s[n-i];
		tmp -= a[i]*i*2;
		ans = max(ans,tmp);
	}
	cout << ans << endl;
	return 0;
}