from itertools import product
from collections import deque

N=int(input())
C=list(map(int,input().split()))
C.sort()

T=[]
for i,j in product([0,1],repeat=2):
    Q=deque(C[:])
    a=b=0
    for k in range(N):
        if k%2==0:
            if i==0:
                x=Q.popleft()
            else:
                x=Q.pop()
            a+=x
        else:
            if j==0:
                y=Q.popleft()
            else:
                y=Q.pop()
            b+=y
    T.append(abs(a)-abs(b))

nn,np,pn,pp=T
print(max(min(nn,np),min(pn,pp)))