#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[n+1];
for(ll i = 1; i <= n; i++)
cin >> a[i];
ll dp[n+1] = {0};
dp[1] = max(a[1], 0LL);
if(n >= 2)
dp[2] = max(a[1], a[2]);
for(ll i = 3; i <= n; i++)
dp[i] = max(dp[i-1], a[i] + dp[i-2]);
cout << dp[n];
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp0eXBlZGVmIGxvbmcgbG9uZyBsbDsKCmludCBtYWluKCkgewogICAgbGwgbjsKICAgIGNpbiA+PiBuOwoKICAgIGxsIGFbbisxXTsKCiAgICBmb3IobGwgaSA9IDE7IGkgPD0gbjsgaSsrKQogICAgICAgIGNpbiA+PiBhW2ldOwoKICAgIGxsIGRwW24rMV0gPSB7MH07CgogICAgZHBbMV0gPSBtYXgoYVsxXSwgMExMKTsKCiAgICBpZihuID49IDIpCiAgICAgICAgZHBbMl0gPSBtYXgoYVsxXSwgYVsyXSk7CgogICAgZm9yKGxsIGkgPSAzOyBpIDw9IG47IGkrKykKICAgICAgICBkcFtpXSA9IG1heChkcFtpLTFdLCBhW2ldICsgZHBbaS0yXSk7CgogICAgY291dCA8PCBkcFtuXTsKCiAgICByZXR1cm4gMDsKfQ==