n = int(input())
Y = list(map(int, input().split()))
Y.sort()

if len(set(Y)) == 1:
    print(1)
    exit()

from itertools import accumulate
C = [0]+Y
C = list(accumulate(C))
#print(C)

ans = 10**18
# 0~i, i+1~n-1
for i in range(n-1):
    temp = 0
    if (i+1)%2 == 1:
        m = i//2
        temp += C[i+1]-C[m+1]-(C[m]-C[0])
    else:
        m = i//2
        temp += C[i+1]-C[m+1]-(C[m+1]-C[0])
    if (n-i-1)%2 == 1:
        m = (n+i)//2
        temp += C[n]-C[m+1]-(C[m]-C[i+1])
    else:
        m = (n+i)//2
        temp += C[n]-C[m+1]-(C[m+1]-C[i+1])
    ans = min(ans, temp)
print(ans)