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 i, n, ans = 1;
  int p[100001], a = 0, b = 0;
  int x[100001];
  x[0] = -9;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> p[i];
    if (p[i] > b) {
      a = b;
      b = p[i];
      x[b] -= 1;
    } else if (p[i] > a) {
      a = p[i];
      x[b] += 1;
    }
  }
  int m = x[1];
  for (i = 2; i <= n; i++) {
    if (x[i] > m) {
      m = x[i];
      ans = i;
    }
  }
  cout << ans;
  return 0;
}
