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.
import sys

cases = sys.stdin.readline()
my_list = [int(a) for a in sys.stdin.readline().split(" ")]
#my_list = [4, 5, 3, 2, 1]

max_val_a = my_list[0]
max_val_b = 0

my_counts = dict()
for x in my_list:
  my_counts[x] = 0

my_counts[max_val_a] = -1

for x in my_list:
  #print(my_counts)
  if(x > max_val_a):
    my_counts[x] = my_counts[x] - 1
    max_val_a, max_val_b = x, max_val_a
  elif (x < max_val_a and x > max_val_b):
    my_counts[max_val_a] = my_counts[max_val_a] + 1
    max_val_b = x
    
#print(my_counts)
highest = max(my_counts.values())
print(min([k for k, v in my_counts.items() if v == highest]))