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 main() {
  int n;
  scanf("%d", &n);
  set<int> s;
  int cnt[100005];
  memset(cnt, 0, sizeof(cnt));
  for (int i = 0; i < n; i++) {
    int a;
    scanf("%d", &a);
    s.insert(a);
    if (*s.rbegin() != a) {
      auto it = s.rbegin();
      it++;
      if (*it == a) {
        cnt[*s.rbegin()]++;
      }
    } else {
      cnt[a]--;
    }
  }
  int ans = 1, Ma = -1;
  for (int i = 1; i <= n; i++) {
    if (cnt[i] > Ma) {
      Ma = cnt[i];
      ans = i;
    }
  }
  printf("%d\n", ans);
}
