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 p[n];
  for (int i = 0; i < n; i++) {
    cin >> p[i];
  }
  vector<int> g;
  g.resize(n + 1, 0);
  multiset<int> arr;
  for (int i = 0; i < n; i++) {
    if (arr.size() >= 1) {
      int a = -(*arr.begin());
      if (a > p[i]) {
        if (arr.size() >= 2) {
          multiset<int>::iterator it = arr.begin();
          it++;
          a = -(*(it));
        }
        if (arr.size() < 2 || a < p[i]) {
          g[-(*arr.begin())]++;
        }
      } else
        g[p[i]]--;
    } else
      g[p[i]]--;
    arr.insert(-p[i]);
  }
  int max_ = -2;
  int ans = 0;
  for (int i = 1; i < n + 1; i++) {
    if (g[i] > max_) {
      max_ = g[i];
      ans = i;
    }
  }
  cout << ans << endl;
  return 0;
}
