n = int(input())

cost=list(map(int, input().split()))
#贪心算和动态规划
dp0 = dp1 =0
for i in range(2,n+1):
    dp = min(dp0+cost[i-2],dp1+cost[i-1])
    dp0,dp1 = dp1,dp

print(dp1)