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.
import bisect

n = int(raw_input())
p = map(int, raw_input().split())
# nums_sorted = [p[0]]
nums_sorted = []
record_prevented = [0 for i in range(n+1)]
# record_prevented[p[0]] = -1
for num in p:
    bisect.insort(nums_sorted, num)
    ind = nums_sorted.index(num)
    if ind == len(nums_sorted) - 1:
        record_prevented[num] = -1
    elif ind == len(nums_sorted) - 2:
        record_prevented[nums_sorted[-1]] += 1
    if len(nums_sorted) > 2:
        nums_sorted.pop(0)
mx, mx_num = -1, 1
for num, rec_prev in enumerate(record_prevented):
    if rec_prev > mx and num > 0:
        mx = rec_prev
        mx_num = num
print mx_num