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 N = 1e5 + 1;
int a[N];
int n, ans;
int mt[N];
void makemax();
int main() {
  int i;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    scanf("%d", a + i);
  }
  makemax();
  ans = 1;
  for (i = 1; i <= n; i++) {
    if (mt[ans] < mt[i]) ans = i;
  }
  printf("%d\n", ans);
}
void makemax() {
  int m1 = 0, m2 = 0, i;
  for (i = 1; i <= n; i++) {
    if (m1 < a[i]) {
      m2 = m1;
      m1 = a[i];
    } else if (m2 < a[i]) {
      m2 = a[i];
    }
    if (m2 <= a[i] && m1 > a[i]) {
      mt[m1]++;
    }
    if (a[i] == m1) mt[m1]--;
  }
}
