inf = 10**9 + 7

n = int(eval(input()))

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

dp = [inf] * n



dp[0] = 0





for i in range(1, n):

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

    if i > 1:

        dp[i] = min(dp[i], dp[i-2]+abs(nodes[i]-nodes[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] = min(dp[i-1] + abs(h[i]-h[i-1]), dp[i-2] + abs(h[i]-h[i-2]))



print((dp[N-1]))

inf = 10**9 + 7
n = int(eval(input()))
nodes = list(map(int, input().split()))
dp = [inf] * n
dp[0] = 0
for i in range(1, n):
    dp[i] = min(dp[i], dp[i - 1] + abs(nodes[i] - nodes[i - 1]))
    if i > 1:
        dp[i] = min(dp[i], dp[i - 2] + abs(nodes[i] - nodes[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] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[N - 1]))

-inf = 10**9 + 7 -n = int(eval(input())) -nodes = list(map(int, input().split())) -dp = [inf] * n -dp[0] = 0 -for i in range(1, n): -    dp[i] = min(dp[i], dp[i - 1] + abs(nodes[i] - nodes[i - 1])) -    if i > 1: -        dp[i] = min(dp[i], dp[i - 2] + abs(nodes[i] - nodes[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] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2])) +print((dp[N - 1]))