#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>

using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "YES" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "NO" << endl;  \
    }
#define IFYes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "Yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "No" << endl;  \
    }
#define IFyes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "no" << endl;  \
    }
#define DEBUG_OUTPUT_ARRAY(XXX, ONE)                            \
    for (int i = 0; i < (ONE); i++)                             \
    {                                                           \
        cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
    }
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO)                             \
    for (int i = 0; i < (ONE); i++)                                    \
    {                                                                  \
        cout << "<<< i = " << i << " >>>" << endl;                     \
        for (int j = 0; j < (TWO); j++)                                \
        {                                                              \
            cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
        }                                                              \
    }
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
    for (int i = 0; i < (ONE); i++)            \
    {                                          \
        cout << i << "  ";                     \
        for (int j = 0; j < (TWO); j++)        \
        {                                      \
            cout << XXX[i][j] << " ";          \
        }                                      \
        cout << endl;                          \
    }

typedef pair<long long int, long long int> pll;


const long long int mod = 1000000007;
const long long int INF = 1e18;

long long int N,M,K,s,w,res=0,A[300000]={};
//今見ている番号＋今どの段階か(なにも飛ばしていない、１つ飛ばした、２つ飛ばした)＋奇数かどうか
long long int ears[200300][10]={};




int main()
{
    cout << fixed << setprecision(18);
    cin>>N;
    for(long long int i = 1; i <= N; i++){
        cin>>A[i];
    }
    if(N%2==0){
        
        for(long long int i = 0; i <= N+5; i++){
            for(long long int j = 0; j < 4; j++){
                ears[i][j]=-INF;
            }
        }
        ears[1][0]=A[1];
        ears[2][1]=A[2];

        
        
        for(long long int i = 3; i <= N; i++){
            for(long long int j = max(1LL,i-3); j <= i-2; j++){
                for(long long int k = 0; k <= 1; k++){
                    ears[i][k+(i-j-2)]=max(ears[i][k+(i-j-2)],ears[j][k]+A[i]);
                }
            }
        }
        cout<<max({ears[N][1],ears[N-1][0]})<<endl;
    }else{
        for(long long int i = 0; i <= N+5; i++){
            for(long long int j = 0; j < 4; j++){
                ears[i][j]=-INF;
            }
        }
        ears[1][0]=A[1];
        ears[2][1]=A[2];
        ears[3][2]=A[3];
        ears[3][0]=A[1]+A[3];

        
        
        for(long long int i = 4; i <= N; i++){
            for(long long int j = max(1LL,i-4); j <= i-2; j++){
                for(long long int k = 0; k <= 2; k++){
                    ears[i][k+(i-j-2)]=max(ears[i][k+(i-j-2)],ears[j][k]+A[i]);
                }
            }
        }
        cout<<max({ears[N][2],ears[N-1][1],ears[N-2][0]})<<endl;
    }

}


Measured memory_bytes: 20792