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;
using ll = long long;
using ld = double;
using pll = pair<ll, ll>;
using vll = vector<ll>;
using vpll = vector<pll>;
using vvll = vector<vll>;
ll N, A[100000];
set<ll> S;
int main() {
  ios::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  cin >> N;
  for (ll i = 0; i < (ll)N; ++i) {
    ll a;
    cin >> a;
    auto it = S.insert(a).first;
    auto m1 = it;
    ++m1;
    if (m1 == S.end()) {
      A[*it]--;
      continue;
    }
    auto m2 = m1;
    ++m2;
    if (m2 == S.end()) A[*m1]++;
  }
  ll resi = 0;
  ll res = -1000;
  for (ll i = 1; i < (ll)N + 1; ++i)
    if (A[i] > res) res = A[i], resi = i;
  cout << resi << endl;
  return 0;
}
