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 n;
int sum[100100], a[100100];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  int mx = 0, mx2 = 0;
  for (int i = 1; i <= n; i++) {
    if (mx < a[i])
      sum[a[i]]--;
    else if (mx2 < a[i] && mx > a[i])
      sum[mx]++;
    if (a[i] > mx) {
      mx2 = mx;
      mx = a[i];
    } else
      mx2 = max(mx2, a[i]);
  }
  int maxn = 1;
  mx = -2;
  for (int i = 1; i <= n; i++) {
    if (sum[i] > mx) {
      maxn = i;
      mx = sum[i];
    }
  }
  cout << maxn << endl;
}
