#include <bits/stdc++.h>

using ll = long long;

int main() {
  std::ios::sync_with_stdio(0);
  int n; std::cin >> n;
  std::vector <ll> a(n + 1), sum(n + 1);
  for(int i = 1; i <= n; i ++) {
    std::cin >> a[i];
  }
  sort(a.begin() + 1, a.begin() + n + 1);
  for(int i = 1; i <= n; i ++) {
    sum[i] = sum[i - 1] + a[i];
  }

  ll ans = 0;
  for(int i = 2; i + 1 <= n; i ++) {
    int l = 1, r = std::min(i - 1, n - i), best = -1;
    while(l <= r) {
      int mid = (l + r) / 2;
      if(a[n - mid + 1] - a[i] > a[i] - a[i - mid]) {
        l = mid + 1;
        best = mid;
      } else {
        r = mid - 1;
      }
    }
    if(best != -1) {
      ans = std::max(ans, (sum[n] - sum[n - best]) + a[i] + (sum[i - 1] - sum[i - 1 - best]) - (2 * best + 1) * a[i]);
    }
  }
  std::cout << ans << '\n';
}