def Bisect_Int(ok,ng,is_ok):
    while abs(ok-ng)>1:
        mid=(ok+ng)//2
        if is_ok(mid):
            ok=mid
        else:
            ng=mid
    return ok

N=int(input())
A=sorted(list(map(int,input().split())))
C=[0]+A
for i in range(1,N+1):
    C[i]+=C[i-1]
ans=0
for m in range(N):
    def is_ok(le):
        return le==0 or A[m-le]+A[N-le]-A[m]*2>=0
    le=Bisect_Int(0,min(m,N-m-1)+1,is_ok)
    ans=max(ans,C[N]-C[N-le]+C[m]-C[m-le]-A[m]*le*2)
print(ans)