> 문제 <

https://www.acmicpc.net/problem/11052

> 풀이 <

> 코드 <

n = int(input())
p = [0] + list(map(int, input().split()))

dp = [0] * (n+1)

dp[1] = p[1]

for i in range(2, n+1):
    for k in range(1, i+1):
        dp[i] = max(dp[i], dp[i-k]+p[k])
print(dp[n])