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

public class C {
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int n = s.nextInt();
		int[] a = new int[n];
		ArrayList<Integer> recLoc = new ArrayList<Integer>();
		int max = 0;
		for (int i = 0; i < n; i++) {
			a[i] = s.nextInt();
			if (a[i] > max) {
				recLoc.add(i);
				max = a[i];
			}
		}
		s.close();
		int[] switchGain = new int[n];
		int bestSwitchIn = -1;
		int bestSwitch = -2;
		for (int i = 0; i < recLoc.size(); i++) {
			int upperBound;
			if (i + 1 < recLoc.size()) {
				upperBound = recLoc.get(i + 1);
			} else {
				upperBound = a.length;
			}
			int curMax;
			int thisSwitch = -1;
			if (i <= 0) {
				curMax = 0;
			} else {
				curMax = a[recLoc.get(i - 1)];
			}
			for (int j = recLoc.get(i) + 1; j < upperBound; j++) {
				if (a[j] > curMax) {
					curMax = a[j];
					thisSwitch++;
				}
			}
			switchGain[a[recLoc.get(i)] - 1] = thisSwitch;
			if (thisSwitch > bestSwitch) {
				bestSwitch = thisSwitch;
				bestSwitchIn = i;
			}
		}
		if (bestSwitch <= 0) {
			for (int i = 0; i < switchGain.length; i++) {
				if (switchGain[i] != -1) {
					System.out.println(i + 1);
					return;
				}
			}
			System.out.println(1);
		} else {
			System.out.println(a[recLoc.get(bestSwitchIn)]);
		}
		s.close();
	}
}
