import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

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

    static class LDeque {
        public void solve(int testNumber, inputClass sc, PrintWriter out) {
            int n = sc.nextInt();
            int[] tab = new int[n];
            for (int i = 0; i < n; i++) {
                tab[i] = sc.nextInt();
            }
            long[][] dp = new long[n][n];

            if (n % 2 == 0) {
                for (int i = 0; i < n; i++) {
                    dp[i][i] = -tab[i];
                }
                for (int len = 2; len <= n; len++) {
                    if (len % 2 == 0) {
                        for (int i = 0; len + i - 1 < n; i++) {
                            dp[i][i + len - 1] = Math.max(dp[i + 1][i + len - 1] + tab[i], dp[i][i + len - 2] + tab[i + len - 1]);
                        }
                    } else {
                        for (int i = 0; len + i - 1 < n; i++) {
                            dp[i][i + len - 1] = Math.min(dp[i + 1][i + len - 1] - tab[i], dp[i][i + len - 2] - tab[i + len - 1]);
                        }
                    }
                }
            } else {
                for (int i = 0; i < n; i++) {
                    dp[i][i] = tab[i];
                }
                for (int len = 2; len <= n; len++) {
                    if (len % 2 == 1) {
                        for (int i = 0; len + i - 1 < n; i++) {
                            dp[i][i + len - 1] = Math.max(dp[i + 1][i + len - 1] + tab[i], dp[i][i + len - 2] + tab[i + len - 1]);
                        }
                    } else {
                        for (int i = 0; len + i - 1 < n; i++) {
                            dp[i][i + len - 1] = Math.min(dp[i + 1][i + len - 1] - tab[i], dp[i][i + len - 2] - tab[i + len - 1]);
                        }
                    }
                }
            }
            out.println(dp[0][n - 1]);
        }

    }

    static class inputClass {
        BufferedReader br;
        StringTokenizer st;

        public inputClass(InputStream in) {

            br = new BufferedReader(new InputStreamReader(in));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

    }
}



Measured memory_bytes: 129344