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 long long N = 2e5;
long long a[N], b[N], c[N];
pair<long long, long long> p, so;
int main() {
  long long n;
  cin >> n;
  for (long long i = (long long)1; i <= (long long)n; i++) {
    cin >> a[i];
    if (a[i] > p.first)
      p.second = p.first, p.first = a[i], b[i] = 1, b[0]++;
    else if (a[i] > p.second)
      p.second = a[i], c[p.first]++;
  }
  p = pair<long long, long long>(0, 0);
  for (long long i = (long long)1; i <= (long long)n; i++) {
    long long k = b[0];
    k -= b[i];
    k += c[a[i]];
    if (i == 1) {
      p.first = k;
      p.second = a[1];
    }
    if (k > p.first) {
      p.first = k;
      p.second = a[i];
    } else if (k == p.first && a[i] < p.second)
      p.second = a[i];
  }
  cout << p.second << '\n';
  ;
}
