# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read

#n,m,*d= [int(i) for i in read().split()]

#a,t,k = [int(i) for i in readline().split()]

n,*a = [int(i) for i in read().split()]
a.sort()
from itertools import accumulate
acc = list(accumulate([0]+a))

ans = 0
for i in range(n):
    ok = 0
    ng = min(i,n-i-1)+1
    
    while ng - ok > 1:
        mid = (ok+ng)//2
        if a[i-mid] + a[n-mid] > 2*a[i]: ok = mid
        else: ng = mid

    res = acc[n]-acc[n-ok]+acc[i+1]-acc[i-ok]-a[i]*(2*ok+1)
    #print(res,i,ok)
    if ans < res: ans = res

print(ans)