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 cnt[100000 + 10];
int cnt_[100000 + 10];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, i;
  cin >> n;
  int arr[n];
  for (i = 0; i < n; i++) cin >> arr[i];
  if (i == 1)
    cout << 1 << "\n";
  else {
    set<int> st;
    st.insert(arr[0]);
    st.insert(arr[1]);
    for (i = 2; i <= n - 1; i++) {
      set<int>::iterator it1 = st.upper_bound(arr[i]);
      if (it1 != st.end()) {
        int x = *it1;
        it1++;
        if (it1 == st.end()) cnt[x]++;
      }
      if (*(--st.end()) < arr[i]) cnt_[arr[i]]++;
      st.insert(arr[i]);
    }
    if (arr[0] < arr[1]) {
      cnt_[arr[1]]++;
      cnt_[arr[0]]++;
    }
    int maxx = 1;
    for (i = 1; i <= n; i++) {
      if (cnt[i] - cnt_[i] > cnt[maxx] - cnt_[maxx]) maxx = i;
    }
    cout << maxx << "\n";
  }
}
