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

#define int long long
#define rep(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)x.size())
template<class T>bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,T b){if(a>b){a=b;return 1;}return 0;}

/*
 */

using vi = vector<int>;
using vvi = vector<vi>;
using P = pair<int,int>;

int n;
int a[201010];

bool check(int x, int m){
  int tmp = (x == 0 ? 1 : a[n-x]+a[m-x]-2*a[m]);
  return tmp > 0;
}

signed main() {
  cin >> n;
  rep(i, 0, n) cin >> a[i];
  sort(a, a+n);
  vi sum(n+1);
  rep(i, 0, n) sum[i+1] = sum[i] + a[i];

  int ans = 0;
  rep(m, 0, n){
    int l = 0, r = min(m+1, n-m);
    while(r-l > 1){
      int mid = (l+r)/2;
      if(check(mid, m)) l = mid;
      else r = mid;
    }
    chmax(ans, sum[n]-sum[n-l]+sum[m]-sum[m-l]-2*a[m]*l);
  }

  cout << ans << endl;

  return 0;
}