#include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <array>
#include <tuple>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <list>
#include <cstdio>
#include <limits.h>
#include <string.h>

using namespace std;
using ull = unsigned long long;
using ll = long long;
using lli = long long int;
using ld = long double;
using pa = pair<int,int>;
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define GRESORT(v) sort(v.begin(),v.end(),greater<int>())
#define REVERSE(v) reverse(v.begin(),v.end())
#define overlap(v) v.erase(unique(v.begin(),v.end()),v.end())
#define debug(x) cout << #x << ": " << x << endl
#define INF 999999999

//4近傍
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};

int n;
vector<lli> v(1100);
void input(){
    cin >> n;
    for(int i = 0; i < n; i++) cin >> v[i];
}

lli dp(){
    vector<lli> d(11100);
    d[0] = v[0];
    d[1] = max(d[0],v[1]);
    for(int i = 2; i < n; i++){
        d[i] = max(d[i-1],d[i-2]+v[i]);
    }
    return d[n-1];
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    input();
    cout << dp() << endl;

    return 0;
}