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 func(l):
    for i in range(len(l)):
        if l[i] != i+1:
            return i+1
    return -1

n = int(raw_input())
l = map(int,raw_input().split())
fir, sec = -1,-1
temp = []
for i in range(n):
    if l[i] > fir:
        sec = fir
        fir = l[i]
    else:
        if l[i] > sec:
            sec = l[i]
    temp.append([fir,sec])
ans = []
for j in range(1,n):
    if temp[j][1] == l[j]:
        ans.append(temp[j][0])
if ans == []:
    if func(l) == -1:
        print 1
    else:
        print func(l)
else:
    ans.sort()
    maxcount = 0
    maxx, count = ans[0], 1
    for i in range(1,len(ans)):
        if ans[i] == ans[i-1]:
            count += 1
            if count > maxcount:
                maxcount = count
                maxx = ans[i]
        else:
            count = 1
    if maxcount == 0:
        if func(l) == -1:
            maxx = 1
        else:
            maxx = func(l)
    print maxx