#include <iostream>
#include <queue>
using namespace std;
int main( )
{
  queue<int> q;
  int n,i,j,br1,br=0,nm,brmax=0,nom=0;
  cin>>n;
  for(i=1;i<=n;i++)
  {
    cin>>nm;
    q.push(nm);
  }
  for(j=1;j<=n;j++)
  { br1=1;
    for(i=1;i<=n;i++)
    {
    if(q.front()==br1)br++;
    br1++;
    q.push(q.front());
    q.pop();
    }if(br>brmax){brmax=br;
    nom=j;
    }
    q.push(q.front());
    q.pop();
    br=0;
  }cout<<nom<<endl;
return 0;

}

