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 n, p[100001], top[100001][2], cnt[100001];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> p[i];
    if (p[i] > top[i - 1][0]) {
      top[i][0] = p[i];
      top[i][1] = top[i - 1][0];
    } else if (p[i] > top[i - 1][1]) {
      top[i][0] = top[i - 1][0];
      top[i][1] = p[i];
    } else {
      top[i][0] = top[i - 1][0];
      top[i][1] = top[i - 1][1];
    }
    if (top[i][1] == p[i]) ++cnt[top[i][0]];
  }
  for (int i = 1; i <= n; ++i)
    if (top[i][0] == p[i]) --cnt[p[i]];
  int best = 1;
  for (int i = 2; i <= n; ++i)
    if (cnt[i] > cnt[best]) best = i;
  cout << best << '\n';
}
