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 num = 200001;
int a[num], r[num];
vector<pair<int, int> > vec;
map<int, int> fre;
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  set<int> s;
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    s.insert(a[i]);
    auto it = s.end();
    it--;
    if (*it == a[i]) {
      r[a[i]] = 1;
      continue;
    } else {
      auto it1 = it;
      it--;
      if (*it <= a[i]) fre[*it1]++;
    }
  }
  int ans = 1;
  for (int i = 1; i < n + 1; i++) {
    if (!r[i]) {
      ans = i;
      break;
    }
  }
  int max1 = 0;
  for (int i = 1; i < n + 1; i++) {
    if (fre[ans] < fre[i] && fre[i] > 1) ans = i;
  }
  cout << ans << "\n";
  return 0;
}
