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

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

int main() {
    int n;
    cin >> n;
    vector<ll> a(n);
    for (int i = 0;i < n;++i) cin >> a[i];
    sort(a.begin(),a.end());
    vector<ll> sums(n+1,0);
    for (int i = 0;i < n;++i) sums[i+1] = sums[i]+a[i];
    ll ans = 0;
    for (int i = 3;i <= n;i += 2) {
        int j = (i+1)/2,k = i-j;
        ans = max(ans,sums[j]+sums[n]-sums[n-k]-a[j-1]*i);
    }
    for (int i = 4;i <= n;i += 2) {
        int j = i/2+1,k = i-j;
        ans = max(ans,sums[j]+sums[n]-sums[n-k]-(a[j-1]+a[j-2])*i/2);
    }
    cout << ans << endl;
}