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())
arr = list(map(int,input().split()))
mx = smx = -100
lis = [0] * (n+1)
for i in range(n):
    if arr[i] > mx:
        smx = mx
        mx = arr[i]
        lis[arr[i]] = -1
    elif arr[i] > smx:
        lis[mx] += 1
        smx = arr[i]
ans = 1
for i in range(1,n+1):
    if lis[i] > lis[ans]:
        ans = i
print(ans)
