#include <iostream>
#include <cstdio>

using namespace std;

const int MAXN = 110;

int n;
int a[MAXN];
int sum[MAXN];

bool calced[MAXN][MAXN];
int dp[MAXN][MAXN];

int S(int l, int r) {
    return sum[r] - sum[l - 1];
}

int calc(int l, int r) {
    if (calced[l][r]) {
        return dp[l][r];
    }

    calced[l][r] = true;
    int& ans = dp[l][r];

    if (l == r) {
        return ans = a[l];
    }

    int ansl = S(l + 1, r) - calc(l + 1, r) + a[l];
    int ansr = S(l, r - 1) - calc(l, r - 1) + a[r];

    return ans = max(ansl, ansr);
}

int main() {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);

    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        sum[i] = a[i] + sum[i - 1];
    }

    cout << calc(1, n) << endl;

    return 0;
}