#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
    ll n;cin >> n;
    vector<ll> a(n),sum(n);
    for(int i=0;i<n;i++){
        cin >> a[i];
        if(!i){
            sum[i]=a[i];
        }
        else{
            sum[i]=sum[i-1]+a[i];
        }
    }
    sort(a.begin(),a.end());
    ll ans=0;
    for(int k=1;k<=n;k++){
        ll ss,ms;
        if(k%2==1){
            ms=a[(k-1)/2]*k;
            ss=sum[(k-1)/2]+sum[n-1]-sum[n-1-(k-1-(k-1)/2)];
        }
        else{
            ms=(a[k/2-1]+a[k/2])*k/2;
            ss=sum[k/2]+sum[n-1]-sum[n-1-(k-1-k/2)];
        }
        ans=max(ans,ss-ms);
    }
    cout << ans << endl;
}