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 C_Remove_Extra_One {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int N = 100001,mx1 =0, mx2=0;
        int[]a = new int[N];int[]add = new int[N];
        for (int i = 0; i < n; i++) {
            a[i]= in.nextInt();
            if(a[i]> mx1){
                add[a[i]]=-1;
            }else if(a[i]> mx2){
                add[mx1]++;
            }
            int tmp = 0;
            if(a[i] > mx2){
                mx2 = a[i];
                if(mx1 < mx2){
                    tmp = mx1;
                    mx1 = mx2;
                    mx2 = tmp;
                }
            }
        }
        int res = Integer.MIN_VALUE,ind=0;
        for (int i = 1; i <=n; i++) {
            if(res<add[i]){
                res = add[i];
                ind = i;
            }
        }
        System.out.println(ind);
    }   
}
