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 + 10;
int n, ans, mx, mn, a[N], b[N];
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  mx = INT_MIN, mn = INT_MIN;
  for (int i = 0; i < n; i++) {
    if (mx < a[i]) {
      b[a[i]]--;
      mn = mx;
      mx = a[i];
    } else if (mn < a[i]) {
      b[mx]++;
      mn = a[i];
    }
  }
  b[0] = -1;
  for (int i = n; 0 < i; i--) {
    if (b[ans] <= b[i]) ans = i;
  }
  cout << ans;
  return 0;
}
