#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
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; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const ll mod=1000000007;
const ll LINF=1ll<<60;
const int INF=1<<30;
int dx[]={1,0,-1,0,1,-1,1,-1};
int dy[]={0,1,0,-1,1,-1,-1,1};


int main(){
    int n;cin >> n;
    vector<ll> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    sort(ALL(a));
    ll ans = 0;
    ll sum = 0;
    ll l, r;
    for (int i = 0; i < n; i++) {
        if(i % 2){
            sum += a[n - i/2 - 1];
            r = a[n - i/2 - 1];
            ll m = (l + r) / 2;
            ll sc = sum - (i + 1) * m;
            chmax(ans, sc);
        }
        else{
            sum += a[i/2];
            l = a[i/2];
            ll m = l;
            ll sc = sum - (i + 1) * m;
            chmax(ans, sc);
        }
    }
    sort(RALL(a));
    sum = 0;
    for (int i = 0; i < n; i++) {
        if(i % 2){
            sum += a[n - i/2 - 1];
            r = a[n - i/2 - 1];
            ll m = (l + r) / 2;
            ll sc = sum - (i + 1) * m;
            chmax(ans, sc);
        }
        else{
            sum += a[i/2];
            l = a[i/2];
            ll m = l;
            ll sc = sum - (i + 1) * m;
            chmax(ans, sc);
        }
    }
    cout << ans << endl;
    return 0;
}