#!/usr/bin/env python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import itertools
N, *A = map(int, read().split())
A = sorted(A)
Acum = tuple(itertools.accumulate(A))


def solve(mid):
    left = mid
    right = N - 1 - mid
    n = min(left, right)
    if n == 0:
        return 0
    LR = mid - 1
    LL = LR - n + 1
    RR = N - 1
    RL = RR - n + 1
    left = -1  # とらない
    right = n  # とる
    while left + 1 < right:
        x = (left + right) // 2
        if A[LL + x] + A[RL + x] <= 2 * A[mid]:
            left = x
        else:
            right = x
    if right == n + 1:
        return 0
    i = left
    SL = Acum[LR]
    if LL + i >= 0:
        SL -= Acum[LL + i]
    SR = Acum[RR] - Acum[RL + i]
    S = SL + SR + A[mid]
    n_elem = (LR - LL - left) * 2 + 1
    return S - A[mid] * n_elem


answer = max(solve(i) for i in range(N))
print(answer)