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())
dct = {}
for i in range(1,n+1):
	dct[i] = 0
max1 = 0
max2 = 0
for i in list(map(int,raw_input().split())):
	if i < max1:
		if i > max2:
			dct[max1] += 1
			max2 = i

	else:
		dct[i] -= 1
		max1,max2 = i,max1


m = -100
for i in dct:
	if dct[i] > m:
		m = dct[i]
		ans = i
print(ans)
