#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996) 
 
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;
 
using namespace std;


int main(int argc, char* argv[])
{
    int n;
    scanf("%d", &n);
    vector<ll> a(n);
    vector<ll> s(n+1);
    int i;
    for(i=0; i<n; i++) {
        scanf("%lld", &a[i]);
    }
    sort(a.begin(), a.end());

    for(i=0; i<n; i++) {
        s[i+1]=s[i]+a[i];
    }
    ll ans=-INF;
    for(i=0; i<n; i++) {
        int k=MIN(i,n-i-1);
        if(k<0) continue;
        int l=0,r=k+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;
            }
        }
        ll ans0=s[n]-s[n-l]+s[i]-s[i-l]-(ll)a[i]*l*2;
        ans=MAX(ans,ans0);
    }
    for(i=0; i<n-1; i++) {
        int k=MIN(i,n-i-2);
        if(k<0) continue;
        int l=0,r=k+1;
        while(r-l>1) {
            int m=(l+r)/2;
            if(a[n-m]>a[i]+a[i+1]-a[i-m]) {
                l=m;
            }
            else {
                r=m;
            }
        }
        ll ans0=s[n]-s[n-l]+s[i]-s[i-l]-(ll)(a[i]+a[i+1])*(l+1);
        ans=MAX(ans,ans0);
    }
    printf("%lld\n", ans);

    return 0;
}