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);
  if (n == 0) exit(0);
  vector<int> p(n + 1, 0);
  for (int i = 1; i < n + 1; i++) scanf("%d", &p[i]);
  vector<int> records(n + 1, 0);
  int max_1 = -1;
  int max_2 = -1;
  for (int i = 1; i < n + 1; i++) {
    if (p[i] > max_1) {
      max_2 = max_1;
      max_1 = p[i];
      records[p[i]]--;
    } else if (p[i] > max_2) {
      records[max_1]++;
      max_2 = p[i];
    }
  }
  int ans = 1;
  for (int i = 1; i < n + 1; i++) {
    if (records[i] > records[ans]) {
      ans = i;
    }
  }
  printf("%d\n", ans);
  return 0;
}
