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(raw_input())
arr = map(int, raw_input().split())

remove_count = [-5] + [0] * n

largest_element = 0
second_largest = 0
for a in arr:
  if a >= second_largest:
    if a >= largest_element:
      second_largest = largest_element
      largest_element = a
      remove_count[a] -= 1
    else:
      remove_count[largest_element] += 1
      second_largest = a

best_count = -5
best_element = remove_count[0]
for element, count in enumerate(remove_count):
  if count > best_count:
    best_count = count
    best_element = element

print best_element
