#include<iostream>
#include<algorithm>
using namespace std;

int optimalGameStrategy(int *a, int i, int j){
    // cout<<"i and j"<<i << " "<<j<<endl;
   for(int k = i; k <= j; k++)
    //     cout<<a[k]<<" ";
    // cout<<endl;
    if(i == j){
         //cout<<" return max = "<<a[i]<<endl;
        return a[i];
    }
    if(i+1 == j){
       // cout<<" return max = "<<max(a[i],a[j])<<endl;
        return max(a[i],a[j]);

    }

    int piyush = max(a[i] + min(optimalGameStrategy(a, i + 2, j), optimalGameStrategy(a, i + 1, j - 1)) ,
    a[j] + min(optimalGameStrategy(a, i + 1, j - 1), optimalGameStrategy(a, i, j - 2)));
    // cout<<"piyush = "<<piyush<<endl;

    return piyush;
}

int main(){
    int n;
    cin>>n;
    int *a = new int[n];
    for(int i = 0; i < n; i++)
        cin>>a[i];
    cout<<optimalGameStrategy(a, 0, n - 1);

    return 0;
}