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 int INF = 1e9 + 7;
using namespace std;
int n;
set<int> s;
int a[100005];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    int p;
    cin >> p;
    set<int>::iterator it = s.end(), it2;
    if (it == s.begin())
      a[p]--;
    else {
      it--;
      if (*it < p)
        a[p]--;
      else {
        it2 = it;
        if (it2 != s.begin()) {
          it2--;
          if (*it2 < p) a[*it]++;
        } else
          a[*it]++;
      }
    }
    s.insert(p);
  }
  int i = 1;
  for (int j = 2; j <= n; j++)
    if (a[j] > a[i]) i = j;
  cout << i;
  return 0;
}
