#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }


int N;
vector<long long> a, s;

long long solve() {
    sort(a.begin(), a.end(), greater<long long>());
    s.assign(N+1, 0);
    for (int i = 0; i < N; ++i) s[i+1] = s[i] + a[i];

    //COUT(a);

    long long res = 0;
    for (int median = 1; median < N-1; ++median) {
        int mak = min(median, N-1-median);
        int left = 1, right = mak + 1;
        while (right - left > 1) {
            int mid = (left + right) / 2;
            if (a[mid-1] - a[median] >= a[median] - a[median+mid]) left = mid;
            else right = mid;
        }
        long long tmp = s[median+1+left] - s[median+1] + s[left];
        tmp -= a[median] * left * 2;

        //COUT("----------"); COUT(median); COUT(left); COUT(tmp);
        
        chmax(res, tmp);
    }
    return res;
}

int main() {
    while (cin >> N) {
        a.resize(N);
        for (int i = 0; i < N; ++i) cin >> a[i];
        cout << solve() << endl;
    }
}