n = int(eval(input()))

h = [int(i) for i in input().split()]



#dp[i] = そこに辿り着くまでのコスト

#初期条件 dp[0] = 0, dp[1] = |h[1] - h[0]|, dp[2以上] = 10 ** 9 + 7

dp = [10**9+7] * n

dp[0] = 0

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

if n == 2:

    print((dp[1]))

else:

    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]))

n = int(eval(input()))

h = [int(i) for i in input().split()]



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

for i in range(2,n):

    dp.append(min(dp[-2] + abs(h[i] - h[i-2]),dp[-1] + abs(h[i] - h[i-1])))

print((dp[n-1]))

n = int(eval(input()))
h = [int(i) for i in input().split()]
# dp[i] = そこに辿り着くまでのコスト
# 初期条件 dp[0] = 0, dp[1] = |h[1] - h[0]|, dp[2以上] = 10 ** 9 + 7
dp = [10**9 + 7] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
if n == 2:
    print((dp[1]))
else:
    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]))

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

-# dp[i] = そこに辿り着くまでのコスト -# 初期条件 dp[0] = 0, dp[1] = |h[1] - h[0]|, dp[2以上] = 10 ** 9 + 7 -dp = [10**9 + 7] * n -dp[0] = 0 -dp[1] = abs(h[1] - h[0]) -if n == 2: -    print((dp[1])) -else: -    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])) +dp = [0, abs(h[1] - h[0])] +for i in range(2, n): +    dp.append(min(dp[-2] + abs(h[i] - h[i - 2]), dp[-1] + abs(h[i] - h[i - 1]))) +print((dp[n - 1]))