import sys

n = int(sys.stdin.readline().strip('\n'))

h = list(map(int, sys.stdin.readline().strip('\n').split()))

dp = [float('inf') for _ in range(n)]

dp[0] = 0

for i in range(n):

  # 配るdp

  if i+1<=n-1: dp[i+1] = min(dp[i+1], dp[i] + abs(h[i]-h[i+1]))

  if i+2<=n-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()))

INF = float('inf')

costs = [INF for _ in range(n)]

costs[0] = 0

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

for i in range(2, n):

  costs[i] = min([costs[i], 

                  costs[i - 2] + abs(h[i] - h[i - 2]),

                  costs[i - 1] + abs(h[i] - h[i - 1])])

ans = int(costs[-1])

print(ans)
import sys

n = int(sys.stdin.readline().strip("\n"))
h = list(map(int, sys.stdin.readline().strip("\n").split()))
dp = [float("inf") for _ in range(n)]
dp[0] = 0
for i in range(n):
    # 配るdp
    if i + 1 <= n - 1:
        dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]))
    if i + 2 <= n - 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()))
INF = float("inf")
costs = [INF for _ in range(n)]
costs[0] = 0
costs[1] = abs(h[1] - h[0])
for i in range(2, n):
    costs[i] = min(
        [
            costs[i],
            costs[i - 2] + abs(h[i] - h[i - 2]),
            costs[i - 1] + abs(h[i] - h[i - 1]),
        ]
    )
ans = int(costs[-1])
print(ans)

-import sys - -n = int(sys.stdin.readline().strip("\n")) -h = list(map(int, sys.stdin.readline().strip("\n").split())) -dp = [float("inf") for _ in range(n)] -dp[0] = 0 -for i in range(n): -    # 配るdp -    if i + 1 <= n - 1: -        dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1])) -    if i + 2 <= n - 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())) +INF = float("inf") +costs = [INF for _ in range(n)] +costs[0] = 0 +costs[1] = abs(h[1] - h[0]) +for i in range(2, n): +    costs[i] = min( +        [ +            costs[i], +            costs[i - 2] + abs(h[i] - h[i - 2]), +            costs[i - 1] + abs(h[i] - h[i - 1]), +        ] +    ) +ans = int(costs[-1]) +print(ans)