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;
int32_t main() {
  ios::sync_with_stdio(false);
  long long n;
  cin >> n;
  set<long long> s = {-2, -1};
  vector<long long> arr(n, 0);
  while (n--) {
    long long x;
    cin >> x;
    --x;
    if ((*prev(s.end())) > x && (*prev(prev(s.end()))) < x)
      ++arr[(*prev(s.end()))];
    if ((*prev(s.end())) < x) --arr[x];
    s.insert(x);
  }
  cout << (max_element(arr.begin(), arr.end()) - arr.begin() + 1) << endl;
  return 0;
}
