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 INF = 2e6;
const long long LINF = 8e18;
const int MOD = 1e9 + 7;
const long double EPS = 1e-9;
int n, a[INF];
bool rec[INF];
void read() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
}
void find_rec() {
  int MAX = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] > MAX) rec[i] = 1;
    MAX = max(MAX, a[i]);
  }
}
int find_ans() {
  int MAX = 0, cnt_max = 0, i = 0;
  while (i < n) {
    int cnt = 0;
    int j = i + 1;
    while (rec[i] && j < n && !rec[j]) {
      if (a[j] > MAX) cnt++;
      MAX = max(MAX, a[j]);
      j++;
    }
    MAX = a[i];
    i = j;
    if (cnt > 1) cnt_max = max(cnt_max, cnt);
  }
  int ans = INF;
  bool flag = 0;
  if (cnt_max < 2) {
    for (int i = 0; i < n; i++)
      if (!rec[i]) {
        ans = min(ans, a[i]);
        flag = 1;
      }
    if (!flag) {
      for (int i = 0; i < n; i++) ans = min(ans, a[i]);
    }
  } else {
    MAX = 0, i = 0;
    while (i < n) {
      int cnt = 0;
      int j = i + 1;
      while (rec[i] && j < n && !rec[j]) {
        if (a[j] > MAX) cnt++;
        MAX = max(MAX, a[j]);
        j++;
      }
      if (cnt_max == cnt) ans = min(ans, a[i]);
      MAX = a[i];
      i = j;
    }
  }
  return ans;
}
int main() {
  read();
  if (n == 1) {
    printf("%d\n", a[0]);
    return 0;
  }
  find_rec();
  int ans = find_ans();
  printf("%d\n", ans);
  return 0;
}
