n = int(input())
v = list(map(int, input().split(' ')))

def dp():
    m = [0] * (n+2)    
    for i in reversed(range(n)):
        m[i] = max(m[i+1], m[i+2] + v[i])
    print(m[0])
dp()