N = gets.to_i
A = gets.split.map(&:to_i).sort
RUI = [0]

A.each do |a|
  RUI << RUI.last + a
end

ans = 0

1.upto(N - 2) do |mid|
  m = A[mid]

  ok = 0
  ng = mid + 1

  while (ok - ng).abs >= 2
    len = (ok + ng) / 2
    l = mid - len
    r = N - len

    d1 = A[l] - m
    d2 = A[r] - m

    if d2 + d1 > 0
      ok = len
    else
      ng = len
    end
  end

  len = ok
  sum1 = RUI[mid] - RUI[mid - len]
  sum2 = RUI[N] - RUI[N - len]
  sum = sum1 + sum2 - 2 * len * m

  ans = sum if ans < sum
end

puts ans