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 MAX = 1e5 + 5;
const int INF = 1e9 + 7;
long long int arr[MAX];
long long int pos[MAX];
long long int cnt[MAX];
signed main() {
  cin.tie(NULL);
  cout.tie(NULL);
  ios::sync_with_stdio(0);
  set<long long int> ms;
  set<long long int>::iterator it;
  long long int n;
  cin >> n;
  ms.insert(0);
  for (long long int i = 0; i < n; ++i) {
    cin >> arr[i];
    auto it = ms.rbegin();
    if (arr[i] > *it) {
      cnt[arr[i]]--;
    } else {
      ++it;
      if (arr[i] > *it) {
        cnt[*ms.rbegin()]++;
      }
    }
    ms.insert(arr[i]);
  }
  long long int ans = 1;
  for (long long int i = 1; i <= n; ++i) {
    if (cnt[i] > cnt[ans]) {
      ans = i;
    }
  }
  cout << ans << endl;
  return 0;
}
