900_C. Remove Extra One
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.
```python
a=int(input())
b=[]
for i in range(a+1):
    b.append(0)
fir=0
sec=0
for i in (input().split(' ')):
    j=int(i)
    if j>fir:
        sec=fir
        fir=j
        b[j]=1
    elif j>sec:
        sec=j
        b[fir]-=1
ans=1
for i in range(1,a+1):
    if b[i]<b[ans]:
        ans=i
print(ans)
    			 		    			 	 		 	 		  		
```