INF = 1 << 60
N = int(input())
Y = list(map(int, input().split()))
Y.sort()

dp = [[INF] * 2 for _ in range(N+1)]
dp[0][1] = 0
for i in range(N-1):
    y = Y[i]
    dp[i+1][0] = min(dp[i+1][0], dp[i][0] + abs(Y[i] - Y[i+1]))
    dp[i+1][0] = min(dp[i+1][0], dp[i][1] + abs(Y[i] - Y[i+1]))

    dp[i+1][1] = min(dp[i+1][1], dp[i][0])

ans = dp[N-1][0]
print(ans)