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 a[100005], x[100005], y[100005], n, k, cnt[100005];
int main(void) {
  int i, j;
  k = 1;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d", &a[i]);
  memset(x, 0, sizeof(x));
  memset(y, 0, sizeof(y));
  memset(cnt, 0, sizeof(cnt));
  for (i = 1; i <= n; i++) {
    x[i] = x[i - 1];
    y[i] = y[i - 1];
    if (a[i] > x[i]) {
      y[i] = x[i];
      x[i] = a[i];
    } else if (a[i] > y[i]) {
      y[i] = a[i];
    }
  }
  for (i = 1; i <= n; i++) {
    if (y[i] == a[i]) {
      cnt[x[i]]++;
    }
    if (x[i] == a[i]) {
      cnt[a[i]]--;
    }
  }
  for (i = 2; i <= n; i++) {
    if (cnt[i] > cnt[k]) {
      k = i;
    }
  }
  printf("%d\n", k);
  return 0;
}
