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.
# Author : nitish420 --------------------------------------------------------------------
from sys import stdin 
from collections import defaultdict
input=stdin.readline

n=int(input())
l=list(map(int,input().split()))
if n<=2:
    print(min(l))
    exit()

mx,smx=0,0

records=[0]*(n)

dct=defaultdict(int)



total=0

for i in range(n):
    if mx<l[i]:
        smx=mx
        mx=l[i]
    elif smx<l[i]:
        smx=l[i]
    
    if l[i]==mx:
        records[i]=1
        total+=1
    elif smx==l[i]:
        dct[mx]+=1
    
ans=[0]*(n)

mx=0

for i in range(n):
    ans[i]=total-records[i]+dct[l[i]]
    if mx<ans[i]:
        mx=ans[i]

mm=n+1

for i in range(n):
    if ans[i]==mx:
        if mm>l[i]:
            mm=l[i]

print(mm)
