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 cnt[(int)(1.1e5)];
int main() {
  int n, a[(int)(1.1e5)], b1 = 0, b2 = 0, mi = (int)(1.1e5), pre = 0;
  bool yes = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    if (a[i] > pre) {
      cnt[a[i]]--;
      pre = a[i];
    }
    if (a[i] == n) yes = 1;
    if (yes) mi = min(mi, a[i]);
  }
  if (n < 3) {
    puts("1");
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    if (a[i] > b1) {
      b2 = b1;
      b1 = a[i];
    } else if (a[i] > b2) {
      cnt[b1]++;
      b2 = a[i];
    }
  }
  int ans, q = -110000;
  for (int i = 1; i <= n; i++) {
    if (cnt[i] > q) {
      q = cnt[i];
      ans = i;
    }
  }
  printf("%d\n", ans);
  return 0;
}
