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