Buggy python submission (verdict: Runtime Error):
import sys

INF = float('inf')

def rec(i: int):
    #if(i==0):print(i,H[i])
    #if(i>=1):print(i,H[i],H[i-1])
    #if(i>=2):print(i,H[i],H[i-2])
    if dp[i] < INF:
        return dp[i]

    if i==0: return 0
    res = INF

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

    if i > 1:
        res = min(res,rec(i-2)+abs(H[i]-H[i-2]))

    dp[i] = res
    return dp[i]

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

dp = [INF] * (N+2)

print(rec(N-1))

#7
#2 9 4 5 1 6 10


Fixed submission:
import sys


N = int(input())

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

dp = [float('inf')]*N

dp[0] = 0
#print(N)
#print(H)
#print(dp)


for i in range(1,N):
    if(i==1):
        dp[1] = abs(H[1]-H[0])
    else:
        dp[i] = dp[i-1]+abs(H[i]-H[i-1])
        if(dp[i] > dp[i-2]+abs(H[i]-H[i-2])):
            dp[i] = dp[i-2]+abs(H[i]-H[i-2])
        #
        #print(i,dp)

print(dp[-1])

#7
#2 9 4 5 1 6 10

Buggy python submission (verdict: Runtime Error):
import sys

def rec(i):
    #if(i==0):print(i,H[i])
    #if(i>=1):print(i,H[i],H[i-1])
    #if(i>=2):print(i,H[i],H[i-2])
    if i==0:return 0

    res = abs(H[i]-H[i-1]) + rec(i-1)


    if(i==1): return res

    res2 = abs(H[i]-H[i-2]) + rec(i-2)

    return min(res,res2)

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

print(rec(N-1))

#7
#2 9 4 5 1 6 10


Fixed submission:
import sys


N = int(input())

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

dp = [float('inf')]*N

dp[0] = 0
#print(N)
#print(H)
#print(dp)


for i in range(1,N):
    if(i==1):
        dp[1] = abs(H[1]-H[0])
    else:
        dp[i] = dp[i-1]+abs(H[i]-H[i-1])
        if(dp[i] > dp[i-2]+abs(H[i]-H[i-2])):
            dp[i] = dp[i-2]+abs(H[i]-H[i-2])
        #
        #print(i,dp)

print(dp[-1])

#7
#2 9 4 5 1 6 10

Buggy python submission (verdict: Runtime Error):
import sys


def rec(i):
    #if(i==0):print(i,H[i])
    #if(i>=1):print(i,H[i],H[i-1])
    #if(i>=2):print(i,H[i],H[i-2])
    #print(i)
    if (dp[i] < float('inf')): return dp[i]
    if(i==0): return 0

    res = float('inf')
    res = rec(i-1)+abs(H[i]-H[i-1])
    if(i==1): return res

    calc = rec(i-2)+abs(H[i]-H[i-2])
    if(res > calc):
        res = calc

    dp[i] = res

    return res

N = int(input())
H = list(map(int,input().split()))
dp = [float('inf')]*N

#print(N)
#print(H)

print(rec(N-1))

#7
#2 9 4 5 1 6 10


Fixed submission:
import sys


N = int(input())

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

dp = [float('inf')]*N

dp[0] = 0
#print(N)
#print(H)
#print(dp)


for i in range(1,N):
    if(i==1):
        dp[1] = abs(H[1]-H[0])
    else:
        dp[i] = dp[i-1]+abs(H[i]-H[i-1])
        if(dp[i] > dp[i-2]+abs(H[i]-H[i-2])):
            dp[i] = dp[i-2]+abs(H[i]-H[i-2])
        #
        #print(i,dp)

print(dp[-1])

#7
#2 9 4 5 1 6 10

Buggy python submission (verdict: Runtime Error):
import sys


def rec(i):
    #if(i==0):print(i,H[i])
    #if(i>=1):print(i,H[i],H[i-1])
    #if(i>=2):print(i,H[i],H[i-2])
    print(i)
    if (dp[i] < float('inf')): return dp[i]
    if(i==0): return 0

    res = float('inf')
    res = rec(i-1)+abs(H[i]-H[i-1])
    if(i==1): return res

    calc = rec(i-2)+abs(H[i]-H[i-2])
    if(res > calc):
        res = calc

    dp[i] = res

    return res

N = int(input())
H = list(map(int,input().split()))
dp = [float('inf')]*N

#print(N)
#print(H)

print(rec(N-1))

#7
#2 9 4 5 1 6 10


Fixed submission:
import sys


N = int(input())

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

dp = [float('inf')]*N

dp[0] = 0
#print(N)
#print(H)
#print(dp)


for i in range(1,N):
    if(i==1):
        dp[1] = abs(H[1]-H[0])
    else:
        dp[i] = dp[i-1]+abs(H[i]-H[i-1])
        if(dp[i] > dp[i-2]+abs(H[i]-H[i-2])):
            dp[i] = dp[i-2]+abs(H[i]-H[i-2])
        #
        #print(i,dp)

print(dp[-1])

#7
#2 9 4 5 1 6 10

Buggy python submission (verdict: Runtime Error):
import sys


def rec(i):
    #if(i==0):print(i,H[i])
    #if(i>=1):print(i,H[i],H[i-1])
    #if(i>=2):print(i,H[i],H[i-2])


    if(i==0): return 0

    res = float('inf')
    res = rec(i-1)+abs(H[i]-H[i-1])
    if(i==1): return res

    if(res > rec(i-2)+abs(H[i]-H[i-2])):
        res = rec(i-2)+abs(H[i]-H[i-2])

    return res

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


#print(N)
#print(H)

print(rec(N-1))

#7
#2 9 4 5 1 6 10


Fixed submission:
import sys


N = int(input())

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

dp = [float('inf')]*N

dp[0] = 0
#print(N)
#print(H)
#print(dp)


for i in range(1,N):
    if(i==1):
        dp[1] = abs(H[1]-H[0])
    else:
        dp[i] = dp[i-1]+abs(H[i]-H[i-1])
        if(dp[i] > dp[i-2]+abs(H[i]-H[i-2])):
            dp[i] = dp[i-2]+abs(H[i]-H[i-2])
        #
        #print(i,dp)

print(dp[-1])

#7
#2 9 4 5 1 6 10