n=int(input())
v=list(map(int,input().split()))
dp=[0]*n
dp[0]=v[0]
dp[1]=max(v[0],v[1])
for i in range(2,n):
    dp[i]=max(dp[i-2]+v[i],dp[i-1])
print(sum(dp[i]))