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())
pi = list(map(int,input().split()))
if n == 1:
    print(1)
else:
    num = [0]*n
    num[0] = -1
    maxs = [0] * 4
    maxs[0] = pi[0]
    for i in range(1,n):
        if pi[i] > maxs[0]:
            maxs[2] = maxs[0]
            maxs[3] = maxs[1]
            maxs[0] = pi[i]
            maxs[1] = i
        elif pi[i] > maxs[2]:
            maxs[2] = pi[i]
            maxs[3] = i

        if maxs[1] == i:
            num[i] -= 1
        if maxs[3] == i:
            num[maxs[1]] += 1
    max1 = num[0]
    max2 = 0
    for i in range(1,n):
        if num[i] > max1:
            max1 = num[i]
            max2 = i
        if num[i] == max1:
            if pi[max2] > pi[i]:
                max2 = i
    print(pi[max2])
