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 + 2;
int cnt[N];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  int arr[n];
  for (int i = 0; i < n; i++) cin >> arr[i];
  pair<int, int> p = {0, arr[0]};
  cnt[arr[0]]--;
  for (int i = 1; i < n; i++) {
    if (arr[i] > p.first && arr[i] < p.second) {
      cnt[p.second]++;
      p.first = arr[i];
    } else if (arr[i] > p.second) {
      p.first = p.second;
      p.second = arr[i];
      cnt[arr[i]]--;
    }
  }
  int maxi = -1e9, maxiE = -1;
  for (int i = 1; i <= n; i++) {
    if (maxi < cnt[i]) {
      maxi = cnt[i];
      maxiE = i;
    }
  }
  cout << maxiE;
}
