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.
n=int(input())
rec,m1,m2=[0]*(n+1),0,0
l=list(map(int, raw_input().split()))
for i in l:
    if i>m1:
        m2=m1
        m1=i
        rec[i]-=1
    elif i>m2:
        rec[m1]+=1
        m2=i
rec=rec[1:]
print rec.index(max(rec))+1
