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 INF = 1E9;
int vl[100010];
int main() {
  ios_base::sync_with_stdio(0);
  int n, i, first, a, b;
  set<int> nx;
  nx.insert(INF);
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> first;
    nx.insert(first);
    a = *nx.upper_bound(first);
    if (a == INF) {
      --vl[first];
      continue;
    }
    b = *nx.upper_bound(a);
    if (b == INF) {
      ++vl[a];
    }
  }
  int ans = 1;
  for (int i = 1; i <= n; ++i) {
    if (vl[i] > vl[ans]) {
      ans = i;
    }
  }
  cout << ans << endl;
}
