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 cnt[100005];
int main() {
  int n, i, a, mx1 = 0, mx2 = 0, ans = 10000000;
  cin >> n;
  fill(cnt, cnt + 100005, 0);
  for (i = 0; i < n; i++) {
    cin >> a;
    if (a <= mx1) ans = min(ans, a);
    if (a < mx1 && a > mx2) cnt[mx1]++;
    if (a > mx1) {
      mx2 = mx1;
      mx1 = a;
    } else if (a > mx2)
      mx2 = a;
  }
  if (ans == 10000000) ans = 1;
  mx1 = 1;
  for (i = 1; i <= n; i++) {
    if (cnt[i] > mx1) {
      ans = i;
      mx1 = cnt[i];
    }
  }
  cout << ans << endl;
  return 0;
}
