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;
const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const double pi = acos(-1);
int a[maxn];
int main() {
  int n, ans = 1;
  scanf("%d", &n);
  int x, Max1 = -inf, Max2 = -inf;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &x);
    if (x > Max1) {
      Max2 = Max1;
      Max1 = x;
      a[Max1]--;
    } else if (x > Max2) {
      Max2 = x;
      a[Max1]++;
    }
  }
  int res = -1;
  for (int i = 1; i <= n; ++i) {
    if (a[i] > res) res = a[i], ans = i;
  }
  printf("%d\n", ans);
  return 0;
}
