using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); public static void Main() { Solve(); } static void Solve() { var n = NN; var a = NList; if (n == 1) { WriteLine(a[0]); return; } // 区間[i,j]が未収穫,0なら左に,1なら右にいる var INF = int.MaxValue / 2; var dp = new int[n, n, 2]; for (var i = 0; i < n; ++i) for (var j = 0; j < n; ++j) for (var k = 0; k < 2; ++k) dp[i, j, k] = INF; dp[1, n - 1, 0] = a[0]; dp[0, n - 2, 1] = a[n - 1]; var q = new Queue<(int l, int r, int k)>(); q.Enqueue((1, n - 1, 0)); q.Enqueue((0, n - 2, 1)); var visited = new bool[n, n, 2]; visited[1, n - 1, 0] = true; visited[0, n - 2, 1] = true; var ans = INF; while (q.Count > 0) { var cur = q.Dequeue(); if (cur.l < cur.r) { if (cur.k == 0) { dp[cur.l + 1, cur.r, 0] = Math.Min(dp[cur.l + 1, cur.r, 0], Math.Max(dp[cur.l, cur.r, cur.k] + 1, a[cur.l])); dp[cur.l, cur.r - 1, 1] = Math.Min(dp[cur.l, cur.r - 1, 1], Math.Max(dp[cur.l, cur.r, cur.k] + cur.r - cur.l + 1, a[cur.r])); } else { dp[cur.l + 1, cur.r, 0] = Math.Min(dp[cur.l + 1, cur.r, 0], Math.Max(dp[cur.l, cur.r, cur.k] + cur.r + 1 - cur.l, a[cur.l])); dp[cur.l, cur.r - 1, 1] = Math.Min(dp[cur.l, cur.r - 1, 1], Math.Max(dp[cur.l, cur.r, cur.k] + 1, a[cur.r])); } if (!visited[cur.l + 1, cur.r, 0]) { q.Enqueue((cur.l + 1, cur.r, 0)); visited[cur.l + 1, cur.r, 0] = true; } if (!visited[cur.r, cur.r - 1, 1]) { q.Enqueue((cur.l, cur.r - 1, 1)); visited[cur.l, cur.r - 1, 1] = true; } } else { ans = Math.Min(ans, Math.Max(dp[cur.l, cur.r, cur.k] + 1, a[cur.l])); } } WriteLine(ans); } }