#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define range(a) a.begin(), a.end()

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
  int N; cin >> N;
  vector<ll> A(N); rep(i, N) cin >> A[i];
  sort(range(A));
  vector<ll> S(N + 1); rep(i, N) S[i + 1] = S[i] + A[i];
  ll ans = LLONG_MIN;
  for (int i = 0; i < N; i++) {
    int k = min(i, N - (i + 1));
    auto f = [&](int x) -> ll {
      return (S[i] - S[i - x]) + (S[N] - S[N - x]) + A[i] - A[i] * (2 * x + 1);
    };
    int l = -1;
    int r = k;
    while (r - l > 1) {
      int m = (l + r) / 2;
      if (f(m) <= f(m + 1)) l = m; else r = m;
    }
    ans = max(ans, f(r));
  }
  cout << ans << endl;
}