import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      
      A.sort;
      auto ASum = new long[N + 1];
      foreach (i; 0 .. N) {
        ASum[i + 1] = ASum[i] + A[i];
      }
      
      long ans;
      foreach (i; 0 .. N) {
        // median: A[i]
        int lo = 0, hi = min(i, N - 1 - i) + 1;
        for (; lo + 1 < hi; ) {
          const mid = (lo + hi) / 2;
          ((A[N - mid] + A[i - mid] >= 2 * A[i]) ? lo : hi) = mid;
        }
        long score;
        score += (ASum[i] - ASum[i - lo]);
        score += (ASum[N] - ASum[N - lo]);
        score -= 2 * lo * A[i];
        debug {
          writeln(i, ": ", hi, " ", score);
        }
        chmax(ans, score);
      }
      foreach (i; 0 .. N - 1) {
        // median: (A[i] + A[i + 1]) / 2
        int lo = 0, hi = min(i, N - 2 - i) + 1;
        for (; lo + 1 < hi; ) {
          const mid = (lo + hi) / 2;
          ((A[N - mid] + A[i - mid] >= 2 * A[i]) ? lo : hi) = mid;
        }
        long score;
        score += (ASum[i] - ASum[i - lo]);
        score += (ASum[N] - ASum[N - lo]);
        score -= lo * (A[i] + A[i + 1]);
        debug {
          writeln(i, " ", i + 1, ": ", lo, " ", score);
        }
        chmax(ans, score);
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}