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 main() {
  int n;
  cin >> n;
  vector<int> a(n);
  vector<int> b(n, 0);
  vector<bool> r(n, true);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    int y = -1;
    for (int j = 0; j < i; j++) {
      if (a[j] >= a[i]) {
        if (y == -1) {
          y = j;
          r[i] = false;
        } else {
          y = -1;
          break;
        }
      }
    }
    if (y != -1) {
      b[y]++;
    }
  }
  for (int i = 0; i < n; i++) {
    if (r[i]) {
      b[i]--;
    }
  }
  int max = 0;
  for (int i = 1; i < n; i++) {
    if (b[i] > b[max] || (b[i] == b[max] && a[i] < a[max])) {
      max = i;
    }
  }
  cout << a[max] << endl;
  return 0;
}
