import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop, core.thread;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) throw new EOFException; tokens = readln.split; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


immutable INF = 10L^^18;

int N;
long[] A;

void main() {
  try {
    for (; ; ) {
      N = readInt;
      A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      auto dp = new long[][](N + 1, N + 1);
      foreach (i; 0 .. N + 1) {
        dp[i][i] = 0;
      }
      foreach (k; 1 .. N + 1) {
        for (int i = 0, j = k; j <= N; ++i, ++j) {
          dp[i][j] = max(A[i] - dp[i + 1][j], A[j - 1] - dp[i][j - 1]);
        }
      }
      writeln(dp[0][N]);
    }
  } catch (EOFException e) {
  }
}
