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;
  cin >> n;
  int arr[n];
  for (int i = 0; i < n; i++) cin >> arr[i];
  int tw[2];
  tw[0] = 0;
  tw[1] = arr[0];
  int cnt[n + 1];
  bool is[n + 1];
  memset(cnt, 0, sizeof(cnt));
  memset(is, 0, sizeof(is));
  is[arr[0]] = 1;
  for (int i = 1; i < n; i++) {
    if (arr[i] > tw[1]) is[arr[i]] = 1;
    if (arr[i] > tw[0] && arr[i] < tw[1]) {
      cnt[tw[1]]++;
    };
    if (arr[i] > tw[0]) tw[0] = arr[i];
    if (tw[0] > tw[1]) tw[0] ^= tw[1] ^= tw[0] ^= tw[1];
  }
  int res = 1;
  if (is[1]) cnt[1]--;
  for (int i = 2; i <= n; i++) {
    if (is[i]) cnt[i]--;
    if (cnt[i] > cnt[res]) res = i;
  }
  cout << res;
}
