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.
bit = [0] * 100100

def upd(pos, x):
	while pos < 100100:
		bit[pos] += x
		pos += pos & (-pos)

def sum(pos):
	res = 0
	while pos > 0:
		res += bit[pos];
		pos -= pos & (-pos)
	return res

def main():

	n = int(input())

	arr = [0]
	for x in input().split():
		arr.append(int(x))

	pont = [0] * 100100
	
	if n == 1:
		print(1)
		exit()
	elif n == 2:
		print(1)
		exit()
	else:
		
		maxi = arr[1]
		upd(arr[1],1)
		pont[arr[1]] = -1

		for i in range(2,n+1):
			'''	
			print("sum[",n,"] = ",sum(n))
			print("sum[",arr[i],"] = ",sum(arr[i]))
			print()
			'''

			if (sum(n) - sum(arr[i])) == 1:
				#se eu tirar consigo 1
				pont[maxi] += 1
			if (sum(n) - sum(arr[i])) == 0:
				#se eu tirar perco 1
				pont[arr[i]] -= 1
			upd(arr[i],1)
			maxi = max(maxi, arr[i])
		
		resp = -9999999
		for i in range(1,n+1):
			resp = max(resp,pont[i])

		res = 99999999
		for i in range(1,n+1):
			#	print(i, ": ", pont[i])
			if resp == pont[i]:
				res = min(res, i)	

		print(res)

main()
