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 i, j, k, n, m, x, y, z, arr[(int)(2e5 + 10)], a, b, c, mx, mx2,
    A[(int)(2e5 + 10)];
int ata[(int)(2e5 + 10)], L[(int)(2e5 + 10)], R[(int)(2e5 + 10)],
    wh[(int)(2e5 + 10)], ans, H[(int)(2e5 + 10)], St[2 * (int)(2e5 + 10)];
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> arr[i];
  }
  for (i = 1; i <= n; i++) {
    if (mx < arr[i]) {
      mx2 = mx;
      mx = arr[i];
    } else if (mx2 < arr[i])
      mx2 = arr[i];
    if (arr[i] == mx2) A[mx]++;
    if (arr[i] == mx) A[mx]--;
  }
  ans = 1;
  for (i = 1; i <= n; i++) {
    if (A[i] > A[ans])
      ans = i;
    else if (A[i] == A[ans] and arr[i] < A[ans])
      ans = i;
  }
  cout << ans << '\n';
}
