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 pii = pair<int, int>;
int const N = 100 * 1000 + 16;
int const M = 1000 * 1000 * 1000 + 7;
int n;
int a[N];
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  cin >> n;
  set<int> s;
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    auto f = s.upper_bound(x);
    if (f == s.end() || next(f) != s.end()) {
      if (f == s.end()) a[x]--;
      s.insert(x);
    } else {
      a[*f]++;
      s.insert(x);
    }
  }
  cout << (max_element(a + 1, a + n + 1) - a);
}
