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.*;
public class maestro{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];
        for (int i=0;i<n;i++) arr[i]=sc.nextInt();
        //int[] bool = new int[n];
        int[] chances = new int[n];
        for (int i=0;i<n;i++) chances[i]=0;
        //bool[0]=1;
        chances[0]--;
        for (int i=1;i<n;i++){
            int count=0;
            int max=-1;
            int idx=-2;
            for (int j=0;j<i;j++){
                if (arr[j]>arr[i]){
                    count++;
                }
                if (max<arr[j]){
                    max=arr[j];
                    idx=j;
                }
                if (count>1){
                    //bool[i]=0;
                    chances[i]=0;
                    break;
                }
            }
            if (count==1){
                //bool[i]=-1;
                chances[idx]++;
            }
            else if(count==0){
                //bool[i]=1;
                chances[i]--;
            }
        }
        int ans=-2;
        int min=0;
        for (int i=0;i<chances.length;i++){
            if (chances[i]>ans){
                ans=chances[i];
                min=arr[i];
            }
            else if (chances[i]==ans&&min>arr[i])min = arr[i];
        }
        System.out.println(min);
    }
}