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 long long N = 2e5 + 10, M = 201, mod = 1e9 + 7, OO = 1e16;
int n, A[N], add[N];
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> A[i];
  ;
  set<int> second;
  for (int i = 0; i < n; ++i) {
    auto it = second.upper_bound(A[i]);
    if (it == second.end()) {
      add[A[i]] = -1;
    }
    second.insert(A[i]);
  }
  second.clear();
  for (int i = 0; i < n; ++i) {
    auto it = second.upper_bound(A[i]);
    if (it != second.end()) {
      if (it == (--second.end())) {
        add[*it]++;
      }
    }
    second.insert(A[i]);
  }
  int x = *max_element(add, add + n + 1);
  for (int i = 1; i <= n; ++i) {
    if (add[i] == x) {
      cout << i << "\n";
      return 0;
    }
  }
  cout << 1 << "\n";
}
