#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
#define vvvvll vector<vector<vector<vector<ll>>>>
#define vvvll vector<vector<vector<ll>>>
#define vvll vector<vector<ll>>
#define vll vector<ll>
#define pqll priority_queue<ll>
#define pqllg priority_queue<ll, vector<ll>, greater<ll>>

constexpr ll INF = (1ll << 60);
constexpr ll mod = 1000000007;  // 998244353;
constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}

void pt_vvll(vvll v) {
    ll vs = v.size(), vs0 = v[0].size();
    rep(i, vs) {
        rep(j, vs0) {
            cout << v[i][j];

            if (j != vs0 - 1)
                cout << " ";
            else
                cout << "\n";
        }
    }
}
void pt_vll(vll v) {
    ll vs = v.size();
    rep(i, vs) {
        cout << v[i];
        if (i == vs - 1)
            cout << "\n";
        else
            cout << " ";
    }
}

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

    ll N;
    cin >> N;
    vll v(N);
    rep(i, N) cin >> v[i];

    vvll dp(N + 10, vll(5e4 + 10));
    dp[0][v[0]] = 1;
    if (N >= 2) dp[1][v[1]] = 1;
    rep(i, N) {
        rep(j, 5e4 + 10) {
            if (i + 3 < N && j + v[i] < 5e4 + 10 && dp[i][j])
                dp[i + 3][j + v[i + 3]] = 1;
            if (i + 2 < N && j + v[i] < 5e4 + 10 && dp[i][j])
                dp[i + 2][j + v[i + 2]] = 1;
        }
    }

    ll ans = 0;
    rep(i, N + 10) rep(j, 5e4 + 10) if (dp[i][j]) chmax(ans, j);
    cout << ans << "\n";
    return 0;
}