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.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		int mx = Integer.MIN_VALUE;
		int mx2 = Integer.MIN_VALUE;
		int mn = Integer.MIN_VALUE;
		int res = 0;

		int n = input.nextInt();
		int[] a = new int[n + 1];
		for (int i = 0; i < n; i++) {
			int x = input.nextInt();
			if (x > mx) {
				mx2 = mx;
				mx = x;
				a[x]--;
			} else if (x > mx2) {
				a[mx]++;
				mx2 = x;
			}
		}
		for (int i = 1; i <= n; i++) {
			if (a[i] > mn) {
				mn = a[i];
				res = i;
			}
		}
		System.out.println(res);
	}

}