#include<iostream>
using namespace std;
int main(){
	long long n;
	cin>>n;
	long long otkoj[n],jelanie[n],max=-1;
	for (long long i=0;i<n;i++){
		otkoj[i]=0;
	}
	for (long long i=0;i<n;i++){
		cin>>jelanie[i];
		int nulev=(n+i-jelanie[i]+1)%n;
		otkoj[nulev]+=1;
		if (max==-1 || otkoj[max]<otkoj[nulev] || (otkoj[max]==otkoj[nulev] && max>nulev))	max=nulev;
	}
	cout<<(max+1)%(n+1);
	//zashtoto max namira indexa na nulevoto chislo
	return 0;
}
