#include using namespace std; typedef pair P; typedef long long ll; #define rep(i,n) for(int i=0;i> N; int cost[1001]; for(int i = 1; i <= N; i++) cin >> cost[i]; dp[0] = 0; dp[1] = cost[1]; for(int i = 2; i <= N; i++){ dp[i] = max(dp[i-1], dp[i-2]+cost[i]); } int res = -1; for(int i = 1; i <= N; i++) res = max(res, dp[i]); cout << res << endl; return 0; }