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

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<int> a(n);
  for (auto&& e : a) {
    cin >> e;
  }
  sort(begin(a), end(a));
  vector<long long> c(n + 1);
  for (int i = n; i--; ) {
    c[i] = a[i] + c[i + 1];
  }
  long long res = 0;
  for (int m = 1; m < n - 1; ++m) {
    int ok = 0, ng = min(m, n - m - 1) + 1;
    while (ng - ok > 1) {
      int mid = (ok + ng) / 2;
      (a[m - mid] + a[n - mid] > 2 * a[m] ? ok : ng) = mid;
    }
    res = max(res, (c[m - ok] - c[m]) + (c[n - ok] + c[n]) - (long long)a[m] * (2 * ok));
  }
  cout << res << '\n';
}