#include <bits/stdc++.h>
using namespace std;

using ll = long long int;
using P = pair<int,int>;
using P3 = pair<ll,P>;
using PP = pair<P, P>;
constexpr int INF = 1<<30;
constexpr ll MOD = (1e9)+7;
constexpr int di[] = {0,1,0,-1};
constexpr int dj[] = {1,0,-1,0};

int n;
vector<ll> a, cum;

ll S(int i, int x){
    if(i-x<0 || i+x>=n) return -INF;
    return cum[i]-cum[i-x]+cum[n]-cum[n-x]-a[i]*2*x;
}

int main(){
    cin >> n;
    a.resize(n);
    cum.resize(n+1);
    for(int i=0;i<n;i++){
        cin >> a[i];
    }
    sort(a.begin(),a.end());
    for(int i=0;i<n;i++){
        cum[i+1] = cum[i] + a[i];
    }
    ll ans = 0;
    for(int i=1;i<n-1;i++){
        int ok = 1, ng = min(i,n-1-i)+1;
        while(abs(ok-ng)>1){
            int mid = (ok+ng)/2;
            if(S(i,mid-1) <= S(i,mid)){
                ok = mid;
            }else{
                ng = mid;
            }
        }
        ans = max(ans, S(i,ok));
    }
    cout << ans << endl;
    return 0;
}