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;
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
long long int lcm(long long int a, long long int b) {
  return a * b / gcd(a, b);
}
int n, cnt[100010];
int main() {
  scanf("%d", &n);
  set<int> s;
  for (int i = 0; i < n; i++) {
    int x;
    scanf("%d", &x);
    s.insert(x);
    auto itr = s.find(x);
    itr++;
    if (itr == s.end())
      cnt[x]--;
    else {
      x = *itr;
      itr++;
      if (itr == s.end()) cnt[x]++;
    }
  }
  int ans = 1;
  for (int i = 1; i <= n; i++)
    if (cnt[i] > cnt[ans]) ans = i;
  printf("%d\n", ans);
  return 0;
}
