#include <iostream>
#include <queue>
using namespace std;

queue<int> students;
int n, biggest, output;

int howMany()
{
	int out = 0;
	for(int i = 0;i < n;i ++)
	{
		if(students.front() - 1 == i) {out ++;}
		students.push(students.front());
		students.pop();
	}
	return out;
}

int main()
{
	cin >> n;
	for(int i = 0;i < n;i ++)
	{
		int a; cin >> a;
		students.push(a);
	}
	
	for(int i = 0;i < n;i ++)
	{
		int num = howMany();
		if(num > biggest) {biggest = num; output = i + 1;}
		students.push(students.front());
		students.pop();
	}
	
	cout << output << endl;
	return 0;
}

