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 main() {
  int N;
  scanf("%d", &N);
  int A[N];
  for (int i = 0; i < N; i++) {
    scanf("%d", &A[i]);
  }
  int record[N + 1];
  memset(record, 0, sizeof(record));
  int max1 = 0, max2 = 0;
  for (int i = 0; i < N; i++) {
    if (A[i] > max1) {
      max2 = max1;
      max1 = A[i];
      record[A[i]]--;
    } else if (A[i] > max2) {
      max2 = A[i];
      record[max1]++;
    }
  }
  int max = -100, ans;
  for (int i = 1; i <= N; i++) {
    if (record[i] > max) {
      max = record[i];
      ans = i;
    }
  }
  printf("%d\n", ans);
  return 0;
}
