#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("oo.in");
ofstream fout("oo.out");
int v[100005],d[100005],n;
int din(int plussy)
{
    memset(d, 0, sizeof d);
    for(int i=1+plussy;i<n+plussy-1;i++)
    {
        if(i<2)
            d[i] = max(d[i - 1], d[0] + v[i - 1] + v[i]);
        else
            d[i] = max(d[i - 1], d[i - 3] + v[i - 1] + v[i]);
    }
    return d[plussy + n - 2];
}
int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>v[i];
    }
    v[n+1]=v[1];
    int maxi = max(din(0),max(din(1),din(2)));
    fout<<maxi;
    return 0;
}