/*input
6
4 2 9 7 1 5
*/
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.PriorityQueue;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author masterbios
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CLinovaAndKingdom solver = new CLinovaAndKingdom();
        solver.solve(1, in, out);
        out.close();
    }

    static class CLinovaAndKingdom {

        final int MAXN = (int) (3e3) + 10;
        long a[] = new long[MAXN];
        long dp[][] = new long[MAXN][MAXN];
        int n = 0;

        public void solve(int testNumber, InputReader in, PrintWriter out) {

            n = in.nextInt();
            long sum = 0L;
            for (int i = 0; i < n; i++) {
                a[i] = in.nextLong();
                sum += a[i];
            }
            for (int i = 0; i <= n; i++) {
                for (int j = 0; j <= n; j++) {
                    dp[i][j] = -1;
                }
            }
            long a = solve(0, n - 1);
            long b = sum - a;
            // out.println("sum=" + sum + " a=" + a + " b=" + b);
            out.println(a - b);

        }

        public long solve(int l, int r) {
            if (l > r) return 0;
            if (dp[l][r] != -1) return dp[l][r];
            long ans = 0;
            ans = max(a[l] + min(solve(l + 2, r), solve(l + 1, r - 1)),
                      a[r] + min(solve(l, r - 2), solve(l + 1, r - 1)));
            return dp[l][r] = ans;
        }

        // public int max(int ...a) {
        //     int max = Integer.MIN_VALUE;
        //     for (int i : a) max = Math.max(max, i);
        //     return max;
        // }

        // public int min(int ...a) {
        //     int min = Integer.MAX_VALUE;
        //     for (int i : a) min = Math.min(min, i);
        //     return min;
        // }

        public long max(long ...a) {
            long max = Long.MIN_VALUE;
            for (long i : a) max = Math.max(max, i);
            return max;
        }

        public long min(long ...a) {
            long min = Long.MAX_VALUE;
            for (long i : a) min = Math.min(min, i);
            return min;
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreElements()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

    }
}



Measured memory_bytes: 193060