#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

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