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 collections import defaultdict
from operator import itemgetter
n = int(input().strip())
p = list(map(int, input().strip().split()))


ml = -float('inf')
mli = None
ms = -float('inf')
msi = None

count = defaultdict(int)
isRecord = [0] * n

for i, v in enumerate(p):
    if v > ml:
        isRecord[i] = 1
    if ms < v <= ml:
        count[mli] += 1
    if v >= ml:
        ms, msi = ml, mli
        ml, mli = v, i
    elif v >= ms:
        ms, msi = v, i

num = sum(isRecord)
ma = -float('inf')
mai = None
for i in range(n):
    v = count[i] - isRecord[i] + num
    if v > ma:
        ma = v
        mai = i
    elif v == ma and p[i] < p[mai]:
        mai = i
# print(count)
print(p[mai])