N = int(eval(input()))

H = list(map(int, input().split()))

H.append(0)

H.append(0)



#dp[足場i]=足場iにたどり着く最小コスト

dp = [10**10 for _ in range(N+10)]



dp[0] = 0

for i in range(N):

    dp[i+1] = min(dp[i+1], dp[i] + abs(H[i]-H[i+1]))

    dp[i+2] = min(dp[i+2], dp[i] + abs(H[i]-H[i+2]))



print((dp[N-1]))

N = int(eval(input()))

h = list(map(int, input().split()))



dp = [0] * (N)

dp[1] = abs(h[1] - h[0])

for i in range(2, N):

    dp[i] = dp[i-1] + abs(h[i] - h[i-1])

    dp[i] = min(dp[i], dp[i-2] + abs(h[i] - h[i-2]))



print((dp[N-1]))

N = int(eval(input()))
H = list(map(int, input().split()))
H.append(0)
H.append(0)
# dp[足場i]=足場iにたどり着く最小コスト
dp = [10**10 for _ in range(N + 10)]
dp[0] = 0
for i in range(N):
    dp[i + 1] = min(dp[i + 1], dp[i] + abs(H[i] - H[i + 1]))
    dp[i + 2] = min(dp[i + 2], dp[i] + abs(H[i] - H[i + 2]))
print((dp[N - 1]))

N = int(eval(input()))
h = list(map(int, input().split()))
dp = [0] * (N)
dp[1] = abs(h[1] - h[0])
for i in range(2, N):
    dp[i] = dp[i - 1] + abs(h[i] - h[i - 1])
    dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[N - 1]))

-H = list(map(int, input().split())) -H.append(0) -H.append(0) -# dp[足場i]=足場iにたどり着く最小コスト -dp = [10**10 for _ in range(N + 10)] -dp[0] = 0 -for i in range(N): -    dp[i + 1] = min(dp[i + 1], dp[i] + abs(H[i] - H[i + 1])) -    dp[i + 2] = min(dp[i + 2], dp[i] + abs(H[i] - H[i + 2])) +h = list(map(int, input().split())) +dp = [0] * (N) +dp[1] = abs(h[1] - h[0]) +for i in range(2, N): +    dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]) +    dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]))