#include<iostream>
#include<algorithm>
using namespace std;
bool cmd(pair<int,int>k,pair<int,int>p){
	if(p.first==k.first){
		return k.second>p.second;
	}
	return k.first>p.first;
}
int main(){
	int n;
	cin>>n;
	pair<int,int> k[n];
	for(int i=0;i<n;i++){
		cin>>k[i].second;
		k[i].first=i+2-k[i].second;
		if(k[i].first<=0){
			k[i].first+=n;
		}
		k[i].second=i+1;
	}
	sort(k+0,k+n,cmd);
	/*for(int i=0;i<n;i++){
		cout<<k[i].first<<" "<<k[i].second<<endl;
	}*/
	int currentDovolni=1,maxDovolni=1,minnomer=k[0].second;
	for(int i=1;i<n;i++){
		if(k[i].first==k[i-1].first){
			currentDovolni++;
		}else{
			currentDovolni=1;
		}
		if(maxDovolni<currentDovolni){
			minnomer=k[i].first;
			maxDovolni=currentDovolni;
		}
		if(maxDovolni==currentDovolni&&minnomer>k[i].first){
			minnomer=k[i].first;
		}
	}
	cout<<minnomer;
	
	return 0;
}
