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.io.*;

public class removeextraone {


    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        int n = in.nextInt(), arr[] = new int[n + 1];
        int []x= new int[n+1];
        for (int i = 1; i <= n; i++) {
            x[i]=in.nextInt();
        }
        int osama=0;
        int max=0;
        int max2=0;
        for (int i = 1; i <=n; i++) {
            if (x[i]>max) {
                arr[x[i]]=-1;;
                max2=max;
                max=x[i];
            }else{
                if (x[i]>max2) {
                    arr[max]++;
                    max2=x[i];
                }
            }
    }
       
        int re = Integer.MIN_VALUE ; 
        for (int i = 1; i <=n; i++) {
            if (re<arr[i]) {
                re = arr[i];
                osama = i;
            }
        }
        System.out.println(osama);
    }}