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;
map<int, int> c;
int p[100010];
set<int> pr;
int t[100010];
void solve() {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    int a;
    cin >> a;
    p[i] = a;
    if (pr.empty()) {
      pr.insert(a);
      continue;
    }
    auto up = pr.upper_bound(a), it = pr.end();
    --it;
    if (up == it) {
      ++c[*up];
      c[a] = 1;
    } else if (up != pr.end()) {
      t[a] = 2;
      c[a] = 1;
    }
    pr.insert(a);
  }
  int an = 100010;
  for (int i = 1; i < n + 1; ++i) {
    if (c[an] < c[i] || (c[an] == c[i] && i < an)) an = i;
  }
  cout << an;
}
int main() { solve(); }
