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.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class C {

	static StringTokenizer st;
	static BufferedReader br;
	static PrintWriter pw;
	public static void main(String[] args) throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		int n = nextInt();
		int[]a = new int[n+1];
		for (int i = 1; i <= n; i++) {
			a[i] = nextInt();
		}
		int[]cnt = new int[n+1];
		int []max = new int[n+1];
		for (int i = 1; i <= n; i++) {
			cnt[i] = cnt[i-1];
			max[i] = max[i-1];
			if (a[i] > max[i]) {
				cnt[i]++;
				max[i] = a[i];
			}
		}
		int ans = 0;
		int maxRecond = -1;
		int[]st = new int[n+1];
		int stSize = 0;
		int begin = 1;
		for (int i = n; i >= 1; i--) {
			int curRecord = cnt[i-1];
			while (begin <= stSize && st[begin] > max[i-1])
				begin++;
			curRecord += begin-1;
			if (curRecord > maxRecond || curRecord == maxRecond && a[i] < ans) {
				maxRecond = curRecord;
				ans = a[i];
			}
			while (stSize > 0 && a[i] > st[stSize])
				stSize--;
			st[++stSize] = a[i];
			begin = Math.min(begin, stSize+1);
		}
		System.out.println(ans);
		pw.close();
	}
	private static int nextInt() throws IOException {
		return Integer.parseInt(next());
	}
	private static long nextLong() throws IOException {
		return Long.parseLong(next());
	}
	private static double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}
	private static String next() throws IOException {
		while (st==null || !st.hasMoreTokens())
			st = new StringTokenizer(br.readLine());
		return st.nextToken();
	}
}