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 ans[100005];
int main() {
  ios::sync_with_stdio(0);
  int t = 1;
  while (t--) {
    int n;
    cin >> n;
    int p[n];
    for (long long i = 0; i < n; i++) cin >> p[i];
    int mx1 = 0, mx2 = 0;
    for (long long i = 0; i < n; i++) {
      if (p[i] > mx1) {
        ans[p[i]]--;
        mx2 = mx1;
        mx1 = p[i];
      } else if (p[i] > mx2) {
        mx2 = p[i];
        ans[mx1]++;
      }
    }
    int mx = -2, res;
    for (long long i = 1; i < n + 1; i++) {
      if (ans[i] > mx) {
        res = i;
        mx = ans[i];
      }
    }
    cout << res << endl;
  }
  return 0;
}
