n=int(input())
a=list(map(int,input().split()));ans=0
a.sort()
b=[a[i] for i in range(n)]
for i in range(n-2,-1,-1):
    b[i]+=b[i+1]
for i in range(1,n-1):
    q,w=1,min(i+1,n-i)
    while w-q>1:
        m=(q+w)//2
        if a[i]*2<a[i-m]+a[i+m]:
            q=m
        else:
            w=m
    ans=max(ans,b[-q]+b[i-q]-b[i]-a[i]*q*2)
print(ans)