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 maxn = 1e5 + 100;
int n, fir[maxn], sec[maxn];
int main() {
  scanf("%d", &n);
  set<int> s;
  int num = 0;
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    auto it = s.lower_bound(x);
    if (it == s.end()) {
      num++;
      fir[x] = 1;
    } else if (++it == s.end()) {
      sec[*(--it)]++;
    }
    s.insert(x);
  }
  int mx = -1, pos, cnt;
  for (int i = 1; i <= n; i++) {
    cnt = sec[i] + num - fir[i];
    if (cnt > mx) {
      mx = cnt;
      pos = i;
    }
  }
  printf("%d\n", pos);
}
