#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <climits>
#include <unordered_map>
using namespace std;
ifstream fin("oo.in");
ofstream fout("oo.out");

const int LMAX = 100005;
int dp[LMAX], v[LMAX];
//dp[i] nr maxim de oua luate din primele i elem

int main() {
    int n, i, m1, m2;
    fin>>n;
    fin>>v[1]>>v[2];
    dp[2] = v[2] + v[1];
    for (i = 3; i < n; i++) {
        fin>>v[i];
        dp[i] = max(dp[i-1], v[i-1] + v[i] + dp[i-3]);
    }
    fin>>v[n];
    m1 = dp[n-1];
    dp[1] = dp[2] = 0;
    for(i = 3; i <= n; i++) {
        dp[i] = max(dp[i-1], v[i-1] + v[i] + dp[i-3]);
    }
    m2 = dp[n];
    dp[1] = v[1] + v[n];
    dp[2] = dp[3] = dp[1];
    for (i = 4; i < n-1; i++) {
        dp[i] = max(dp[i-1], v[i-1] + v[i] + dp[i-3]);
    }
    fout<<max(m1, max(m2, dp[n-2]));


    fin.close();
    fout.close();
    return 0;
}