#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  scanf("%d", &n);
  if (n == 0) exit(0);
  vector<int> p(n + 1, 0);
  for (int i = 1; i < n + 1; i++) scanf("%d", &p[i]);
  vector<int> records(n + 1, 0);
  int max_1 = -1;
  int max_2 = -1;
  for (int i = 1; i < n + 1; i++) {
    if (p[i] > max_1) {
      max_2 = max_1;
      max_1 = p[i];
      records[p[i]]--;
    } else if (p[i] > max_2) {
      records[max_1]++;
      max_2 = p[i];
    }
  }
  int ans = 1;
  for (int i = 1; i < n + 1; i++) {
    if (records[i] > records[ans]) {
      ans = i;
    }
  }
  printf("%d\n", ans);
  return 0;
}
