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>
int dr[] = {2, 2, -2, -2, 1, -1, 1, -1};
int dc[] = {1, -1, 1, -1, 2, 2, -2, -2};
int dr1[] = {0, 0, 0, 1, 1, 1, -1, -1, -1};
int dc1[] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
int dr2[] = {0, 0, 1, -1};
int dc2[] = {1, -1, 0, 0};
using namespace std;
long long int a[100005], fr[100005];
int main() {
  long long int n, i, j;
  while (cin >> n) {
    for (long long int i = 1; i < n + 1; i++) cin >> a[i];
    long long int max1 = 0, max2 = 0;
    for (i = 1; i <= n; i++) {
      if (a[i] < max1 && a[i] > max2) {
        fr[max1]++;
      }
      if (a[i] > max1) {
        max2 = max1;
        max1 = a[i];
      } else if (a[i] > max2)
        max2 = a[i];
    }
    max1 = 1;
    long long int ind = -1;
    for (i = 1; i <= n; i++) {
      if (fr[i] > max1) {
        max1 = fr[i];
        ind = i;
      }
    }
    if (ind == -1) {
      max1 = 0;
      max2 = 0;
      long long int min1 = 9999999999999999;
      for (i = 1; i <= n; i++) {
        if (a[i] > max1) {
          if (fr[a[i]] == 1) min1 = min(min1, a[i]);
        } else if (a[i] < max1 && a[i] > max2)
          min1 = min(min1, max1);
        else
          min1 = min(min1, a[i]);
        if (a[i] > max1) {
          max2 = max1;
          max1 = a[i];
        } else if (a[i] > max2)
          max2 = a[i];
      }
      if (min1 == 9999999999999999) min1 = 1;
      ind = min1;
    }
    cout << ind << endl;
  }
  return 0;
}
