def solve(m):
    y1 = y[:m]
    y2 = y[m:]
    ym1 = y1[len(y1) // 2]
    ym2 = y2[len(y2) // 2]
    re = 0
    for yk in y1:
        re += abs(ym1 - yk)
    for yk in y2:
        re += abs(ym2 - yk)
    return re
n = int(input())
y = list(map(int, input().split()))
y.sort()
if y[0] == y[-1]:
    print(1)
    exit()
ans=10**9
for m in range(1,n-1):
    ans=min(ans,solve(m))
print(ans)