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 int N = 1e5 + 1;
int n, A[N], inc[N];
int main() {
  cin >> n;
  for (int x = 0, qwert = n; x < qwert; x++) cin >> A[x];
  set<int> s;
  for (int x = 0, qwert = n; x < qwert; x++) {
    if (s.upper_bound(A[x]) == s.end())
      inc[A[x]]--;
    else if (next(s.upper_bound(A[x])) == s.end())
      inc[*s.upper_bound(A[x])]++;
    s.insert(A[x]);
  }
  int best = -1, mx = 1;
  for (int x = 1, qwert = n + 1; x < qwert; x++)
    if (inc[x] > best) best = inc[x], mx = x;
  cout << mx << "\n";
}
