#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int,int> P;
 
const int INF = 1e9;
const int mod = 1e9+7;
const double EPS = 1e-10;
const double PI = acos(-1.0);

int dp[1010];

int main()
{
    int n;
    cin >> n;
    vector<int> v(n+10,0);
    for(int i = 0; i < n; i++) cin >> v[i];
    dp[0] = v[0];
    dp[1] = v[1];
    for(int i = 2; i <= n; i++){
        dp[i] = max(dp[i-2]+v[i],dp[i]);
        if(i != 2) dp[i] = max(dp[i-3]+v[i],dp[i]);
    }
    cout << max(dp[n-1],dp[n]) << endl;
    return 0;
}