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

int main(){
    int N;
    cin >> N;
    vector<int64_t> A(N), S(N+1);
    for(int i=0; i<N; i++){
        cin >> A[i];
    }
    sort(A.begin(), A.end());
    for(int i=0; i<N; i++) S[i+1] = S[i] + A[i];

    int64_t ans = 0;
    for(int i=0; i<N; i++){
        int ok = 0, ng = min(i, N-1-i)+1;
        while(ng-ok>1){
            int m = (ok+ng)/2;
            (A[N-m]+A[i-m] > 2*A[i] ? ok : ng) = m;
        }
        int64_t res = S[N] - S[N-ok] + S[i] - S[i-ok] - 2*ok*A[i];
        ans = max(ans, res);
    }
    cout << ans << endl;
    return 0;
}