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;
const int magicconst = 1e7;
const long long mod = 1e9 + 7;
int main() {
  ios_base::sync_with_stdio(0);
  int n;
  cin >> n;
  vector<int> p(n);
  for (auto &i : p) cin >> i;
  vector<int> v(n + 1);
  int maxleft = 0;
  int prevmax = 0;
  for (int i = 0; i < n; i++) {
    if (p[i] > prevmax && p[i] < maxleft) {
      v[maxleft]++;
    }
    if (p[i] > maxleft) {
      prevmax = maxleft;
      maxleft = p[i];
      v[p[i]]--;
    } else {
      if (p[i] > prevmax) {
        prevmax = p[i];
      }
    }
  }
  int maxdel = 1;
  for (int i = 1; i < n + 1; i++) {
    if (v[maxdel] < v[i]) {
      maxdel = i;
    }
  }
  cout << maxdel << endl;
}
