n = int(input())
y = list(map(int, input().split()))
y.sort()
if y[0] == y[-1]:
    print(1)
    exit()
lm = 0
rm = (1 + n) // 2
ans = dist = sum(abs(yk - y[rm]) for yk in y[1:])
for m in range(2, n):
    if m % 2:
        tmp = y[m - 1] - y[lm]
    else:
        lm += 1
        d = y[lm] - y[lm - 1]
        tmp = d * (-m + lm * 2 + 1) + y[m - 1] - y[lm]
    w = n - m
    if w % 2:
        tmp -= y[rm] - y[m - 1]
    else:
        rm += 1
        tmp -= y[rm - 1] - y[m - 1]
        d = y[rm] - y[rm - 1]
        tmp += d * (2 * rm - m - n)
    dist += tmp
    if dist < ans:
        ans = dist
#    print(m,dist)
print(ans)