import sys
input = sys.stdin.readline

def judge(i, x):
    return a[N-x]-a[i]>a[i]-a[i-x]

def binary_search(i):
    l, r = 1, min(i, N-i-1)
    
    while l<=r:
        mid = (l+r)//2
        
        if judge(i, mid):
            l = mid+1
        else:
            r = mid-1
            
    return r

N = int(input())
a = list(map(int, input().split()))
a.sort()
acc = [0]

for ai in a:
    acc.append(acc[-1]+ai)

ans = 0

for i in range(N):
    n = binary_search(i)
    right = acc[N]-acc[N-n]
    left = acc[i]-acc[i-n]
    ans = max(ans, right-n*a[i]+left-n*a[i])

print(ans)