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())

if n == 0: exit(0)

p = [0] + input().split(" ")

r = (n + 1) * [0]
max_1 = -1
max_2 = -1

for i in range(1, n + 1):
	p[i] = int(p[i])
	# print(p[i], max_1, max_2)
	if p[i] > max_1:
		max_2 = max_1
		max_1 = p[i]
		r[p[i]] -= 1
	elif p[i] > max_2:
		r[max_1] += 1
		max_2 = p[i]

ans = 100001
val = -100001
for i in range(1, n + 1):
	if r[i] > val:
		ans = i
		val = r[i]

# print(p)
# print(r)
# print(ans, val)
print(ans)