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())
p = list(map(int, input().split()))
antiR = [0] * n
antiR[0] -= 1
mymax = p[0]
mymin = 0
indmax = 0
indmin = -1
for i in range(1, n):
    if mymin < p[i] < mymax:
        antiR[indmax] += 1
        mymin = p[i]
        indmin = i
    elif p[i] > mymax:
        mymin, mymax, indmax, indmin = mymax, p[i], i, indmax
        antiR[i] -= 1

m = max(antiR)
mini = 10 ** 9
for i in range(n):
    if antiR[i] == m:
        mini = min(mini, p[i])
print(mini)