#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;

int main(){
  int N;
  cin>>N;
  vector<ll> A(N);
  rep(i,N) cin>>A[i];

  ll mival=A[0];
  int mit=0;
  for(int i=1;i<N;i++){
    if(mival>A[i]){
      mival=A[i];
      mit=i;
    }
  }

  cout<<mit+1<<endl;

  return 0;
}

