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>
using namespace std;
int main() {
  int n;
  cin >> n;
  int a[n], x[n + 1];
  *x = -1e5;
  fill(x + 1, x + n + 1, 0);
  set<int> s;
  for (int& q : a) {
    cin >> q;
    if (!s.empty()) {
      auto rit = s.rbegin();
      auto smx = *rit;
      bool ltr = s.size() == 1 or *(++rit) < q;
      if (q > smx)
        --x[q];
      else if (ltr)
        ++x[smx];
    } else
      --x[q];
    s.insert(q);
  }
  cout << max_element(x, x + n + 1) - x << endl;
  return 0;
}
