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())
m1=0
m2=0
a=[0]*(n+1)
a[0]=-n-5
mini=n+5
k=list(map(int,input().split()))
m=0

for i in k:
    if i>m:
        a[i]=-1
    else:
        a[i]=0
    m=max(m,i)

if n==1:
    print(k[0])
    exit()

for i in k:
    mini=min(mini,i)
    if m1>i>m2:
        a[m1]+=1
        m2=int(i)
    if i>m1:
        m2=int(m1)
        m1=int(i)

m=max(a)
if m==0:
    print(min(k[1:]))
else:
    print(a.index(m))
