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

if len(set(Y)) == 1:
    print(1)
    exit()
elif len(set(Y)) == 2:
    print(0)
    exit()

Y.sort()
accumY = [0]
for i in range(n):
    accumY.append(accumY[-1] + Y[i])
ans = 10**18
for i in range(1, n):
    res = 0
    if i % 2 == 1:
        res += accumY[i] - 2 * accumY[i // 2] - Y[i // 2]
    else:
        res += accumY[i] - 2 * accumY[i // 2]
    j = n - i
    if j % 2 == 1:
        res += accumY[n] - 2 * accumY[i + j // 2] - Y[i + j // 2] + accumY[i]
    else:
        res += accumY[n] - 2 * accumY[i + j // 2] + accumY[i]
    ans = min(ans, res)
print(ans)