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() {
  long long ma[100005];
  long long a, b, c, d, i, j, k, l;
  while (~scanf("%lld", &a)) {
    long long max1 = 0, max2 = 0;
    long long ans = 1;
    memset(ma, 0, sizeof(ma));
    for (i = 0; i < a; i++) {
      scanf("%lld", &b);
      if (b > max1) {
        ma[b] = -1;
        max2 = max1;
        max1 = b;
      } else if (b > max2) {
        ma[max1]++;
        max2 = b;
      }
    }
    for (i = 1; i <= a; i++) {
      if (ma[ans] < ma[i]) ans = i;
    }
    printf("%lld\n", ans);
  }
}
