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 sys
import math
n=int(input())
arr=list(map(int,sys.stdin.readline().split(' ')))
l=[0 for i in range(n)]
l[0]=-1
if(n==1):
    print(arr[0])

else:
    if(arr[0]>arr[1]):
        m1=arr[0]
        index=0
        m2=arr[1]
        l[0]+=1
        
    elif(arr[0]<arr[1]):
        index=1
        m1=arr[1]
        m2=arr[0]
        l[1]-=1

    for i in range(2,n):
        if(arr[i]<=m1):
            if(arr[i]>m2):
                l[index]+=1
                m2=arr[i]
        else:
            l[i]-=1
            m2=m1
            m1=arr[i]
            index=i
    mm=-10**9
    ans=10**18
    
    for i in range(n):
        if(l[i]>mm):
            mm=l[i]
            ans=arr[i]
        elif(l[i]==mm):
            ans=min(arr[i],ans)
    print(ans)