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 a[100001], rez[100001], ant[100001];
int main() {
  int n, i, j, ma, indmin;
  cin >> n;
  ma = 0;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    if (ma < a[i]) {
      rez[i] = -1;
      ma = a[i];
    }
  }
  for (i = 2; i <= n; i++)
    for (j = 1; j < i; j++)
      if (a[i] < a[j]) {
        if (ant[i] == 0) {
          ant[i] = j;
          rez[j]++;
        } else {
          rez[ant[i]]--;
          ant[i] = -1;
          break;
        }
      }
  indmin = 0;
  ma = -2;
  for (i = 1; i <= n; i++)
    if (rez[i] > ma) {
      indmin = a[i];
      ma = rez[i];
    } else if (rez[i] == ma)
      indmin = min(indmin, a[i]);
  cout << indmin;
  return 0;
}
