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 Solution
{
       public static void main(String []args)
       {
              Scanner sc = new Scanner(System.in);
              int n = sc.nextInt();
              int arr[] = new int[n];
              int cnt[] = new int[n+1];
              int sum[] = new int[n];
              TreeMap<Integer,Integer> map = new TreeMap<Integer,Integer>();
              int prev[] = new int[n];
              for(int i = 0 ; i < n ; i++)
              {
                     if(i > 0)
                     prev[i] = prev[i-1];
                     arr[i] = sc.nextInt();
                     if(map.higherKey(arr[i]) == null)
                     {
                            sum[i]++;
                            prev[i]++;
                     }
                     
                     else
                     {
                            if(map.higherKey(map.higherKey(arr[i])) == null)
                            cnt[map.higherKey(arr[i])]++;
                     }
                     map.put(arr[i],1);
              }
              int x = 0;
              int max = -1;
              int ans = n+1;
              for(int i = n-1 ; i >= 0 ; i--)
              {
                     cnt[arr[i]] += x;
                     x += sum[i];
                     
                     int in = 0;
                     if(i > 0)
                     in = prev[i-1];
                     if(cnt[arr[i]]+in >= max)
                     {
                           if(cnt[arr[i]]+in > max)
                           {
                                  max = cnt[arr[i]]+in;
                                  ans = arr[i];
                           }
                           
                           else
                           {
                                  if(arr[i] < ans)
                                  {
                                         ans = arr[i];
                                  }
                           }
                     }
              }
              System.out.println(ans);
             // System.out.println(cnt[4]+prev[0]);
              //System.out.println(cnt[1]+prev[3]);
              //System.out.println(prev[0]);
              //System.out.println(cnt[4] + " " + cnt[1]);
       }
}