#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

/*
	No.45 回転寿司

	DP解

	dp[0] = 0;
	dp[1] = v[1];
	dp[i] = max (dp[i-1], dp[i-2] + v[i] );	(i >= 2 )
*/

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int MAX_N = 1005;

int dp[MAX_N];
int V[MAX_N];

int main()
{
	memset (dp, 0, sizeof (dp ) );
	memset (V, 0, sizeof (V ) );
	ios_base::sync_with_stdio(0);
	int N; cin >> N;
	for (int i = 1; i <= N; i++ ) cin >> V[i];

	dp[1] = V[1];
	for (int i = 2; i <= N; i++ ){
		dp[i] = max (dp[i-1], dp[i-2] + V[i] );
	} // end for

	cout << dp[N] << endl;

	return 0;
}