def BinarySearch(check, yes, no, i):
    while abs(yes - no) != 1:
        mid = (yes + no)//2
        if check(mid, i):
            yes = mid
        else:
            no = mid
    return yes

N = int(input())
A = sorted(list(map(int, input().split())))
Ac = [0] * (N + 1)
for i in range(N):
    Ac[i + 1] = Ac[i] + A[i]

def check(m, i):
    return A[-1-m] + A[i-m] - 2 * A[i] >= 0   

ans = 0
for i in range(N):
    yes = BinarySearch(check, 0, min(i, N - 1 - i) + 1, i)
    ans = max(ans, Ac[-1] - Ac[-1 - yes] + Ac[i + 1] - Ac[i - yes] - (2 * yes + 1) * A[i])
    
print(ans)