#include<bits/stdc++.h>
#include<iostream>
using namespace std;
using LL = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const long long LINF = 1LL << 60;
#define all(x) (x).begin(), (x).end()
#define rep(i,n) for(int i = 0; i < (n); ++i)
template<class T>void chmin(T&a, T b){if(a > b) a = b;}
template<class T>void chmax(T&a, T b){if(a < b) a = b;}

int main(){
  int N; cin >> N;
  vector<int> V(N);
  for(int i = 0; i < N; ++i) cin >> V[i];
  vector<int> dp(N, 0);
  dp[0] = V[0];
  dp[1] = V[1];
  for(int i = 2; i < N; ++i){
    chmax(dp[i], dp[i-2]+V[i]);
    if(i>2)chmax(dp[i], dp[i-3]+V[i]);
  }
  cout << dp[N-1] << endl;
}