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;
const int N = 1e5 + 5;
const int inf = 0x3f3f3f3f;
int arr[N];
int f[N];
int main() {
  int n;
  scanf("%d", &n);
  int maxn = 0;
  int minn = inf;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &arr[i]);
    if (i == 1) {
      f[arr[i]]--;
    } else if (i == 2) {
      maxn = max(arr[i - 1], arr[i]);
      minn = min(arr[i - 1], arr[i]);
      if (arr[i] < arr[i - 1]) {
        f[arr[i - 1]]++;
      } else {
        f[arr[i]]--;
      }
    } else {
      if (arr[i] > maxn) {
        minn = maxn;
        maxn = arr[i];
        f[maxn]--;
      } else if (arr[i] > minn) {
        f[maxn]++;
        minn = arr[i];
      }
    }
  }
  int ans = 1;
  for (int i = 2; i <= n; i++) {
    if (f[i] > f[ans]) {
      ans = i;
    }
  }
  cout << ans << endl;
  return 0;
}
