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 compare(const void* a, const void* b) {
  return (*(unsigned int*)a - *(unsigned int*)b);
}
int main() {
  int permutation[100000], place[100000], tally[100000];
  int n, max1, max2, maxindex, max1index, max2index, maximum;
  cin >> n;
  maximum = -2;
  maxindex = 0;
  for (int a = 0; a < n; ++a) {
    tally[a] = 0;
  }
  for (int a = 0; a < n; ++a) {
    cin >> permutation[a];
  }
  if (n == 1) {
    cout << permutation[0] << endl;
    return 0;
  }
  if (n == 2) {
    cout << min(permutation[0], permutation[1]) << endl;
    return 0;
  }
  if (permutation[0] > permutation[1]) {
    max1 = permutation[0];
    max2 = permutation[1];
    max1index = 0;
    max2index = 1;
    place[1] = 0;
  } else {
    max2 = permutation[0];
    max1 = permutation[1];
    max2index = 0;
    max1index = 1;
  }
  place[0] = 100001;
  if (permutation[1] > permutation[0]) {
    place[1] = 100001;
  } else {
    place[1] = 0;
  }
  for (int a = 2; a < n; ++a) {
    if (permutation[a] > max1) {
      max2 = max1;
      max2index = max1index;
      max1 = permutation[a];
      max1index = a;
      place[a] = 100001;
    } else if (permutation[a] > max2) {
      max2 = permutation[a];
      max2index = a;
      place[a] = max1index;
    } else {
      place[a] = -1;
    }
  }
  for (int a = 0; a < n; ++a) {
    if (place[a] != -1 && place[a] != 100001) {
      ++tally[place[a]];
    }
    if (place[a] == 100001) {
      --tally[a];
    }
  }
  for (int a = 0; a < n; ++a) {
    if (tally[a] > maximum ||
        (tally[a] == maximum && permutation[a] < permutation[maxindex])) {
      maximum = tally[a];
      maxindex = a;
    }
  }
  cout << permutation[maxindex] << endl;
  return 0;
}
