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 perm[n];
  int max = 0, secondMax = 0;
  int num[n + 1];
  int wasMax[n + 1];
  for (int i = 0; i < n + 1; i++) {
    num[i] = 0;
    wasMax[i] = 0;
  }
  for (int i = 0; i < n; i++) {
    cin >> perm[i];
    if (perm[i] > max) {
      secondMax = max;
      max = perm[i];
      wasMax[max] = 1;
    } else if (perm[i] > secondMax) {
      num[max]++;
      secondMax = perm[i];
    }
  }
  for (int i = 0; i < n + 1; i++) {
    num[i] -= wasMax[i];
  }
  int m = 1, mMax = num[m];
  for (int i = 1; i < n + 1; i++) {
    if (num[i] > mMax) {
      m = i;
      mMax = num[i];
    }
  }
  cout << m;
}
