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;
template <class T>
inline void chkmax(T &x, T y) {
  if (x < y) x = y;
}
template <class T>
inline void chkmin(T &x, T y) {
  if (x > y) x = y;
}
int n, p, ans, fimax, semax, id, tmp, cur, mini = 100100;
int main() {
  scanf("%d", &n);
  ans = cur = -100100;
  for (int i = 0; i < n; i++) {
    scanf("%d", &p);
    if (p > fimax) {
      semax = fimax, fimax = p;
      if (cur > ans) ans = cur, id = tmp;
      cur = -1, tmp = p;
    } else {
      mini = min(mini, p);
      if (p > semax) cur++, semax = p;
    }
  }
  if (cur > ans) ans = cur, id = tmp;
  if (ans <= 0 && mini < 100100) id = mini;
  printf("%d", id);
  return 0;
}
