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;

public class Ideone
{
    public static void main(String[] args)
    {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        
        int[] array = new int[n];
        
        int max1 = 0;
        int max2 = 0;
        
        for(int i = 0; i < n; i++)
        {
            int current = scan.nextInt();
            if(current > max1)
            {
                array[current - 1] = 1;
                max2 = max1;
                max1 = current;
            }
            else if(current > max2)
            {
                array[max1 - 1]--;
                max2 = current;
            }
        }
        
        int index = 0;
        
        for(int i = 0; i < n; i++)
            if(array[i] < array[index])
                index = i;
        
        System.out.println(index + 1);
    }
}