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(raw_input())
t=[int(k) for k in raw_input().split(" ")]

rim1=0
ri=0

i=0
recadd=0
mr=-1
bestremove=0
cfr=0
nonrec=set(range(1,n+1))
if n<=2:
    print 1
else:
    while i<n:
        if t[i]>ri:
            nonrec.discard(t[i])
            rim1,ri=ri,t[i]
            if (recadd>mr) and rim1>0:
                mr=recadd
                bestremove=rim1
            cfr=rim1
            recadd=0
       #     print "yup"
        elif t[i]>cfr:
            recadd+=1
            cfr=t[i]
      #  print t[i],rim1,recadd,mr,bestremove,cfr
        i+=1
    if recadd>mr:
        mr=recadd
        bestremove=ri
    if mr>1:
        print bestremove
    else:
        print min(nonrec) if len(nonrec)>0 else 1