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 bec[100100], cnt[100100], now[100100];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  int max1 = 1, max2 = 1, a, ee = 0;
  vector<int> v;
  for (int i = 0; i < n; i++) {
    cin >> a;
    v.push_back(a);
    if (a >= max2) {
      bec[i] = 1;
      now[a] = 1;
      ee++;
    } else if (a >= max1)
      bec[i] = max2;
    if (a > max2) {
      max1 = max2;
      max2 = a;
    } else if (a > max1)
      max1 = a;
  }
  for (int i = 0; i < n; i++) {
    cnt[bec[i]]++;
  }
  int maxx = ee - now[1], ans = 1;
  for (int i = 2; i <= n; i++) {
    if (ee + cnt[i] - now[i] > maxx) {
      maxx = ee + cnt[i] - now[i];
      ans = i;
    }
  }
  cout << ans;
  return 0;
}
