def solve():
    n = int(input())
    Y = sorted(map(int, input().split()))
    def f(i, j):
        ans = 0
        for k in range(n):
            if k != i and k != j:
                ans += abs(Y[i] - Y[k]) if abs(Y[i] - Y[k]) < abs(Y[j] - Y[k]) else abs(Y[j] - Y[k])
        return ans
    len_set_Y = len(set(Y))
    if len_set_Y == 1:
        return 1
    if len_set_Y == 2 or n == 2:
        return 0
    l = int(n / 2 / 2)
    r = int(n / 2 + l)
    ans = f(l, r)
    next_ans = int(1e10)
    while ans != next_ans:
        ll = (l // 2)
        lr = (l + r) // 2
        rr = (r + n) // 2
        for i, j in ((ll, r), (lr, r), (l, lr), (l, rr)):
            next_ans = min(next_ans, f(i, j))
        ans = min(ans, next_ans)
    return ans
print(solve())