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

int main() {
  ios::sync_with_stdio(false);

  int N;
  cin >> N;

  vector<int> A(N);
  for (int i = 0; i < N; ++i) cin >> A[i];

  sort(A.begin(), A.end());

  vector<int64_t> pa(N + 1);
  for (int i = 0; i < N; ++i) pa[i + 1] = pa[i] + A[i];

  int64_t ans = 0;
  for (int i = 0; i < N; ++i) {
    int lb = 0;
    int ub = min(i, N - (i + 1)) + 1;
    while (ub - lb > 1) {
      int mb = lb + ub >> 1;
      (A[N - mb] + A[i - mb] < 2 * A[i] ? ub : lb) = mb;
    }
    ans = max(ans, pa[N] - pa[N - lb] + pa[i] - pa[i - lb] - (int64_t) 2 * lb * A[i]);
  }

  cout << ans << endl;

  return 0;
}