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 = input()
a = map(int,raw_input().split())
if(n == 1):
    print a[0]

elif(n==2):
    print min(a[0],a[1])



else:

    chomu = [0]*n
    dog = [0]*n
    po = [0,0]
    for i in a:

        
        
        m1 = po[0]
        m2 = po[1]
        if(i > m1):

            dog[i-1] = 1
            
        elif(i < m1 and i > m2):
        
            
            chomu[m1-1] += 1

        else:
            pass
        
        if(i > m1):
            po[0] = i
            po[1] = m1
        elif(i > m2):
            po[1] = i
        else:
            pass

    m = chomu[0]-dog[0]
    
    
    cur = 0
    for i in range(1,n):
        if(chomu[i]-dog[i] > m):
            cur = i
            m = chomu[i]-dog[i]

    print cur+1
    
        
