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 arr[100009];
int xp[100009];
set<int> s;
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &arr[i]);
    auto it = s.lower_bound(arr[i]);
    if (it == s.end())
      xp[arr[i]]--;
    else {
      it++;
      if (it == s.end()) {
        it--;
        xp[*it]++;
      }
    }
    s.insert(arr[i]);
  }
  int mx = -1, ans = 1;
  for (int i = 1; i <= n; i++) {
    if (xp[i] > mx) {
      mx = xp[i];
      ans = i;
    }
  }
  cout << ans << endl;
  return 0;
}
