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;
long long b[100010];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, i, best = 1e10, bestans = 1, num, l1 = -1, l2 = -1;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> num;
    if (num > l1) {
      b[num]++;
      l2 = l1;
      l1 = num;
    } else if (num > l2) {
      b[l1]--;
      l2 = num;
    }
  }
  for (i = 1; i <= n; i++)
    if (b[i] < b[bestans]) bestans = i;
  cout << bestans << endl;
  return 0;
}
