N = int(input())
M = 500_001
V = list(map(int, input().split()))
dp = [[False]*M for _ in range(N+1)]
dp[0][0] = dp[1][0] = dp[1][V[0]] = True
ans = V[0]
for i in range(2, N+1):
    v = V[i-1]
    for j in range(M):
        if v <= j:
            dp[i][j] = dp[i-2][j-v] or dp[i-1][j]
        else:
            dp[i][j] = dp[i-1][j]
        if dp[i][j]:
            ans = max(ans, j)
print(ans)