#include <iostream>
#include <vector>
#include <string>
#include <fstream>
#include <map>
#include <set>
#include <algorithm>
using namespace std;

int main(){
  ios_base::sync_with_stdio(false);
  int n;
  cin >> n;
  vector <pair <int, int> > a(n);
  int x;
  vector <pair <int, int> > b(n);
  for(int i = 0; i < n; i++){
    cin >> x;
    a[i].first = x;
    b[i].first = a[i].first;
    a[i].second = n - (i + 1);
    b[i].second = i + 1;
  }

  sort(a.begin(), a.end());
  for(int i = 0; i < n; i++){
    a[i].second -= i;
  }
  int maxi = -1;
  int co = 0;
  for(int i = 0; i < n; i++){
    if(a[i].second > maxi){
      co = a[i].first;
      maxi = a[i].second;
    }
  }
  for(int i = 0; i < n; i++){
    if(b[i].first == co){
      cout << b[i].second;
      return 0;
    }
  }
}