#include <algorithm>
#include <fstream>

using namespace std;

ifstream fin("oo.in");
ofstream fout("oo.out");

const int nmax= 100000;

int d[nmax+1], v[nmax+1];

int main(  ) {
    int n, sol= 0;
    fin>>n>>v[1]; d[1]= v[1];
    for ( int i= 2; i<=n; ++i ) {
        fin>>v[i];
        d[i]= max( d[i-1], v[i]+v[i-1]+d[i-3] );
    }
    sol= d[n-1];

    d[1]= 0, d[2]= v[2];
    for ( int i= 3; i<=n; ++i ) {
        d[i]= max( d[i-1], v[i]+v[i-1]+d[i-3] );
    }
    
    fout<<max(sol, d[n])<<"\n";

    return 0;
}