You are given a permutation p of length n. Remove one element from permutation to make the number of records the maximum possible.

We remind that in a sequence of numbers a1, a2, ..., ak the element ai is a record if for every integer j (1 ≤ j < i) the following holds: aj < ai. 

Input

The first line contains the only integer n (1 ≤ n ≤ 105) — the length of the permutation.

The second line contains n integers p1, p2, ..., pn (1 ≤ pi ≤ n) — the permutation. All the integers are distinct.

Output

Print the only integer — the element that should be removed to make the number of records the maximum possible. If there are multiple such elements, print the smallest one.

Examples

Input

1
1


Output

1


Input

5
5 1 2 3 4


Output

5

Note

In the first example the only element can be removed.
import java.io.*;
import java.util.*;

public class Main {
	InputReader scn;
	PrintWriter out;
	String INPUT = "3 3 2 1";

	int[] tree, arr;

	void solve() {
		int n = scn.nextInt();
		arr = new int[n + 1];
		tree = new int[4 * n + 4];
		for (int i = 1; i <= n; i++) {
			arr[i] = scn.nextInt();
		}
		build(1, 1, n);

		int[] count = new int[n + 1], is = new int[n + 1];
		is[1] = 1;
		for (int i = 2; i <= n; i++) {
			int l = 1, r = i - 1;
			int rv = query(1, 1, n, l, r);
			if(arr[rv] < arr[i]) {
				is[i]++;
				continue;
			}
			
			int p = query(1, 1, n, l, rv - 1);
			int q = query(1, 1, n, rv + 1, r);
			
			if(arr[p] > arr[i] || arr[q] > arr[i]) {
				continue;
			}
			
			count[rv]++;
		}
		
		int tot = 0;
		for(int i = 1; i <= n; i++) {
			tot += is[i];
			is[i] = -is[i];
		}
		
		int max = tot;
		for(int i = 1; i <= n; i++) {
			count[i] += is[i];
			if(count[i] + tot > max) {
				max = count[i] + tot;
			}
		}
		
		int ans = n;
		for(int i = 1; i <= n; i++) {
			if(count[i] + tot == max) {
				ans = Math.min(ans, arr[i]);
			}
		}
		
		out.println(tot != n ? ans : 1);
	}

	int query(int ind, int l, int r, int si, int li) {
		if (l > li || r < si) {
			return 0;
		}

		if (l >= si && r <= li) {
			return tree[ind];
		}

		int mid = (l + r) / 2, ll = 2 * ind, rr = 2 * ind + 1;

		int x = query(ll, l, mid, si, li);
		int y = query(rr, mid + 1, r, si, li);

		if (arr[x] > arr[y]) {
			return x;
		} else {
			return y;
		}
	}

	void build(int ind, int l, int r) {
		if (l == r) {
			tree[ind] = l;
			return;
		}

		int mid = (l + r) / 2;
		build(2 * ind, l, mid);
		build(2 * ind + 1, mid + 1, r);

		if (arr[tree[2 * ind]] > arr[tree[2 * ind + 1]]) {
			tree[ind] = tree[2 * ind];
		} else {
			tree[ind] = tree[2 * ind + 1];
		}
	}

	void run() throws Exception {
		boolean onlineJudge = System.getProperty("ONLINE_JUDGE") != null;
		out = new PrintWriter(System.out);
		scn = new InputReader(onlineJudge);
		long time = System.currentTimeMillis();
		solve();
		out.flush();
		if (!onlineJudge) {
			System.out.println(Arrays.deepToString(new Object[] { System.currentTimeMillis() - time + " ms" }));
		}
	}

	public static void main(String[] args) throws Exception {
		new Main().run();
	}

	class InputReader {
		InputStream is;

		public InputReader(boolean onlineJudge) {
			is = onlineJudge ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		}

		byte[] inbuf = new byte[1024];
		public int lenbuf = 0, ptrbuf = 0;

		int readByte() {
			if (lenbuf == -1)
				throw new InputMismatchException();
			if (ptrbuf >= lenbuf) {
				ptrbuf = 0;
				try {
					lenbuf = is.read(inbuf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return -1;
			}
			return inbuf[ptrbuf++];
		}

		boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		int skip() {
			int b;
			while ((b = readByte()) != -1 && isSpaceChar(b))
				;
			return b;
		}

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

		char nextChar() {
			return (char) skip();
		}

		String next() {
			int b = skip();
			StringBuilder sb = new StringBuilder();
			while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		char[] next(int n) {
			char[] buf = new char[n];
			int b = skip(), p = 0;
			while (p < n && !(isSpaceChar(b))) {
				buf[p++] = (char) b;
				b = readByte();
			}
			return n == p ? buf : Arrays.copyOf(buf, p);
		}

		char[][] nextMatrix(int n, int m) {
			char[][] map = new char[n][];
			for (int i = 0; i < n; i++)
				map[i] = next(m);
			return map;
		}

		int[] nextArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		int nextInt() {
			int num = 0, b;
			boolean minus = false;
			while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
				;
			if (b == '-') {
				minus = true;
				b = readByte();
			}

			while (true) {
				if (b >= '0' && b <= '9') {
					num = num * 10 + (b - '0');
				} else {
					return minus ? -num : num;
				}
				b = readByte();
			}
		}

		long nextLong() {
			long num = 0;
			int b;
			boolean minus = false;
			while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
				;
			if (b == '-') {
				minus = true;
				b = readByte();
			}

			while (true) {
				if (b >= '0' && b <= '9') {
					num = num * 10 + (b - '0');
				} else {
					return minus ? -num : num;
				}
				b = readByte();
			}
		}
	}
}