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 N = 100100;
int TN = 1;
int n, x, us[N], mn = N, ans;
set<int> st;
void solve() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> x;
    st.insert(x);
    auto it = st.find(x);
    it++;
    if (it == st.end()) {
      us[x]++;
      continue;
    }
    it++;
    if (it == st.end()) {
      it--;
      us[*it]--;
    }
  }
  for (int i = n; i >= 1; i--) {
    if (us[i] <= mn) {
      mn = us[i];
      ans = i;
    }
  }
  cout << ans;
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  while (TN--) solve();
  return 0;
}
