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.
def solve():
    n=input()
    a=map(int,raw_input().split())
    l=[]
    left=[]
    maxi=-1
    for x in xrange(n):
        if a[x]>maxi:
            l.append(x)
            maxi=a[x]
        else:
            left.append(a[x])
    l.append(n)
    a.append(-1)
    maxiIndex=-1
    maxiMax=-1
    # print a
    # print l
    for x in xrange(len(l)-1):
        maxi=a[l[x-1]]
        count=0
        for y in xrange(l[x]+1,l[x+1]):
            if a[y]>maxi:
                maxi=a[y]
                count+=1
        # print count
        if count-1+len(l)-1>maxiMax:
            maxiIndex=l[x]
            maxiMax=count-1+len(l)-1
    if maxiMax<=len(l)-1 and len(left)>0:
        print min(left)
    else:
        print a[maxiIndex]
solve()