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.
from sys import stdin, stdout

n = int(stdin.readline().rstrip())
p = list(map(int,stdin.readline().rstrip().split()))

if n==1:
    print(p[0])
else:
    removeDict={i:0 for i in range(1,n+1)}
    l1 = p[0]
    removeDict[l1]-=1
    l2 = 0
    for i in range(1,n):
        if p[i]>l2:
            if p[i]>l1:
                l2=l1
                l1=p[i]
                removeDict[l1]-=1
            else:
                l2=p[i]
                removeDict[l1]+=1
    maxN = 1
    maxRemove=-10
    for i in range(1,n+1):
        if removeDict[i]>maxRemove:
            maxN = i
            maxRemove = removeDict[i]
    
    print(maxN)
