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 mod = 1e9 + 7;
const int maxn = 1e5;
long long n, m;
int b, k;
int a[maxn + 5];
int main() {
  cin >> n;
  int mx = 0;
  int mxs = 0;
  memset(a, 0, sizeof a);
  for (int i = 1; i <= n; i++) {
    cin >> m;
    if (m > mx) {
      mxs = mx;
      mx = m;
      a[m] = -1;
    } else if (m > mxs) {
      a[mx]++;
      mxs = m;
    }
  }
  a[0] = -1 * maxn;
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] > a[ans]) ans = i;
  }
  cout << ans << endl;
  return 0;
}
