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())
d = {}
a = list(map(int,input().split()))
if n == 1:
    print(a[0])
elif n == 2:
    print(min(a[0],a[1]))
else:
    for i in a:
        d[i] = 0
    t = [max(a[0],a[1]),min(a[0],a[1])]
    if a[1] > a[0]:
        d[a[1]] -= 1
        d[a[0]] -= 1
    for i in a[2:]:
        if i > t[0]:
            t = [i,t[0]]
            d[i] -= 1
        elif i > t[1]:
            d[t[0]] += 1
            t = [t[0],i]
    a,b = -2,n+1
    for i in d:
        if d[i] > a:
            a = d[i]
            b = i
        elif d[i] == a:
            if i < b:
                b = i
    print(b)