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;
int ara[100005];
int mp[100005];
int main() {
  int n;
  cin >> n;
  if (n == 1) {
    int x;
    cin >> x;
    cout << 1 << endl;
    return 0;
  }
  if (n == 2) {
    int x, y;
    cin >> x >> y;
    cout << 1 << endl;
    return 0;
  }
  int mx, smx;
  cin >> mx >> smx;
  if (smx > mx) {
    mp[smx]--;
    mp[mx]--;
    swap(mx, smx);
  }
  for (int i = 2; i < n; i++) {
    int x;
    cin >> x;
    if (mx > x && smx < x) {
      mp[mx]++;
    }
    if (x > mx) {
      smx = mx;
      mx = x;
      mp[x]--;
    } else if (x < mx && x > smx)
      smx = x;
  }
  int ans = 1;
  int mxx = -1000000;
  for (int i = n; i > 0; i--) {
    if (mp[i] >= mxx) {
      mxx = mp[i];
      ans = i;
    }
  }
  cout << ans << endl;
  return 0;
}
