#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() {
  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 = 0;
  rep(i, N) {
    int k = min(i, N - (i + 1));
    ans = max(ans, (S[N] - S[N - k]) + (S[i] - S[i - k]) + A[i] - A[i] * (2*k+1));
  }
  rep(i, N-1) {
    int k = min(i, N - (i + 2));
    ans = max(ans, (S[N] - S[N - k]) + (S[i] - S[i - k]) + A[i] + A[i + 1] - (A[i] + A[i+1])*(k+1));
  }
  cout << ans << endl;
}