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.
#include <bits/stdc++.h>
int main() {
  int n, pi, ratual, ranterior, rinterno, delta, deltamax, roptimal, nrmin;
  std::cin >> n;
  ratual = 0;
  ranterior = 0;
  delta = -1;
  deltamax = 0;
  roptimal = n + 1;
  nrmin = n + 1;
  for (int i = 1; i <= n; i++) {
    std::cin >> pi;
    if (pi > ratual) {
      if (delta > deltamax) {
        deltamax = delta;
        roptimal = ratual;
      }
      if (delta == deltamax) roptimal = std::min(roptimal, ratual);
      ranterior = ratual;
      ratual = pi;
      rinterno = 0;
      delta = -1;
    } else {
      if (pi > ranterior && pi > rinterno) {
        delta++;
        rinterno = pi;
      }
      nrmin = std::min(nrmin, pi);
    }
  }
  if (delta > deltamax) {
    deltamax = delta;
    roptimal = ratual;
  }
  if (delta == deltamax) roptimal = std::min(roptimal, ratual);
  if (deltamax > 0)
    std::cout << roptimal << "\n";
  else {
    if (nrmin <= n)
      std::cout << std::min(nrmin, roptimal) << "\n";
    else
      std::cout << 1 << "\n";
  }
  return 0;
}
