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.*;
import java.lang.*;
import java.io.*;
public class Main{

	public static void main (String[] args) throws java.lang.Exception
	{
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		StringTokenizer st = new StringTokenizer(br.readLine());
		int[] arr = new int[n];
		for (int i = 0; i<n ; i++){
			arr[i] = Integer.parseInt(st.nextToken());
			// System.out.println(arr[i]);
		}
		int m1 = 0;
		int m2 = 0;
		int p1 = -1; int p2 = -1;
		int[] val_arr = new int[n];
		
		for (int i = 0; i<n ; i++){
			// System.out.println(arr[i]);
			// System.out.println(m1);
			// System.out.println(m2);
			if (arr[i] >= m1 && arr[i] >= m2){
				val_arr[i] --;
				m2 = m1;
				m1 = arr[i];
				p2 = p1;
				p1 = i;
			}
			else if (arr[i] <= m1 && arr[i] >= m2){
				val_arr[p1] ++;
				m2 = arr[i];
				p2 = i;
			}
		}
		// for (int i = 0; i<n ; i++){
		// 	System.out.println(val_arr[i]);
		// }
		int val_curr = val_arr[0];
		int max_index = 0;
		int ret_val = arr[0];
		// System.out.println("Now");
		for (int i = 0 ; i< n ; i++){
			// System.out.println(ret_val);
			if (val_curr < val_arr[i]){
				max_index = i;
				ret_val = arr[i];
				val_curr = val_arr[i];
			}
			else if (val_curr == val_arr[i]){
				if (arr[i] < ret_val){
					max_index = i;
					ret_val = arr[i];	
				}
			}
		}
		System.out.println(ret_val);
		
	}
}