n=int(eval(input()))

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

dp=[0 for _ in range(n)]

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



for i in range(2,n):

    single=abs(l[i]-l[i-1])+dp[i-1]

    double=abs(l[i]-l[i-2])+dp[i-2]

    dp[i]=min(single,double)



print((dp[n-1]))
n=int(eval(input()))

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

dp=[10**9]*n

dp[0]=0

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

for i in range(2,n):

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

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

    dp[i]=min(step1,step2)

print((dp[-1]))
n = int(eval(input()))
l = list(map(int, input().split()))
dp = [0 for _ in range(n)]
dp[1] = abs(l[1] - l[0])
for i in range(2, n):
    single = abs(l[i] - l[i - 1]) + dp[i - 1]
    double = abs(l[i] - l[i - 2]) + dp[i - 2]
    dp[i] = min(single, double)
print((dp[n - 1]))

n = int(eval(input()))
H = list(map(int, input().split()))
dp = [10**9] * n
dp[0] = 0
dp[1] = abs(H[1] - H[0])
for i in range(2, n):
    step1 = dp[i - 1] + abs(H[i] - H[i - 1])
    step2 = dp[i - 2] + abs(H[i] - H[i - 2])
    dp[i] = min(step1, step2)
print((dp[-1]))

-l = list(map(int, input().split())) -dp = [0 for _ in range(n)] -dp[1] = abs(l[1] - l[0]) +H = list(map(int, input().split())) +dp = [10**9] * n +dp[0] = 0 +dp[1] = abs(H[1] - H[0]) -    single = abs(l[i] - l[i - 1]) + dp[i - 1] -    double = abs(l[i] - l[i - 2]) + dp[i - 2] -    dp[i] = min(single, double) -print((dp[n - 1])) +    step1 = dp[i - 1] + abs(H[i] - H[i - 1]) +    step2 = dp[i - 2] + abs(H[i] - H[i - 2]) +    dp[i] = min(step1, step2) +print((dp[-1]))