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())
p = list(map(int, input().split(' ')))

if n == 1:
  print(n)
  exit()

m1 = 0
m2 = 0
ret = 1
max_streak = -1
streak = -1
for i in range(n):
  if p[i] > m1:
    if streak > max_streak:
      max_streak = streak
      ret = m1
    elif streak == max_streak and m1 > 0:
      ret = min(ret, m1)
    m2 = m1
    m1 = p[i]
    streak = -1
  elif p[i] > m2:
    if max_streak < 0:
      ret = p[i]
      max_streak = 0
    elif max_streak == 0:
      ret = min(ret, p[i])
    m2 = p[i]
    streak += 1
  else:
    if max_streak < 0:
      ret = p[i]
      max_streak = 0
    elif max_streak == 0:
      ret = min(ret, p[i])


if streak > max_streak:
  ret = m1
elif streak == max_streak:
  ret = min(ret, m1)

print(ret)