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

public class B {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int arr[] = new int[n];
		for (int i = 0; i < n; i++)
			arr[i] = in.nextInt();
		if (n == 1)
		{
			System.out.println("1");
			return;
		}
		TreeSet<Integer> set = new TreeSet<Integer>();
		int ans[] = new int[n + 1];
		for (int i = 0; i < n; i++){
			if (set.ceiling(arr[i]) == null)
				ans[arr[i]]--;
			else if (set.ceiling(arr[i]) != null && set.ceiling(arr[i]) == set.last())
				ans[set.last()]++;
			set.add(arr[i]);
		}
		int mx = Integer.MIN_VALUE;
		int ans1 = -1;
		for (int i = 1; i <= n; i++){
			if (mx < ans[i])
			{
				mx = ans[i];
				ans1 = i;
			}
		}
		System.out.println(ans1);
	}

}