#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int n;
int a[100005];
int cnt[100005];
int main() {
  cin >> n;
  memset(cnt, 0, sizeof(cnt));
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  int maxnum = 0;
  int maxnum2 = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] > maxnum) {
      maxnum2 = maxnum;
      maxnum = a[i];
      cnt[a[i]]--;
    } else if (a[i] > maxnum2) {
      cnt[maxnum]++;
      maxnum2 = a[i];
    }
  }
  int ans;
  int maxs = -100;
  for (int i = 1; i <= n; i++) {
    if (cnt[i] > maxs) {
      maxs = cnt[i];
      ans = i;
    }
  }
  printf("%d\n", ans);
  return 0;
}
