#include <iostream>
#include <algorithm>
#include <time.h>

using namespace std;

int main1 ()
{
	cin.tie (NULL);
	ios::sync_with_stdio (false);
	int n;
	cin >> n;
	int* students = new int [n];
	int* studentsIndex = new int [n];
	for (int i = 0 ; i < n ; i ++)
	{
		cin >> students [i];
		studentsIndex [i] = i;
	}
	int max = 0;
	int answer = n + 1;
	int last = n + 1;
	do
	{
		int current = 0;
		for (int i = 0 ; i < n ; i ++)
		{
			current += (students [studentsIndex [i]] <= (i + 1));
		}
		if (current == -1)
		{
			for (int i = 0 ; i < n ; i ++)
			{
				cout << (studentsIndex [i] + 1) << " ";
			}
			cout << "\n";
		}
		if (max < current)
		{
			answer = studentsIndex [0];
			max = current;
		}
		else if (max == current)
		{
			answer = (answer < studentsIndex [0])?answer:studentsIndex [0];
			max = current;
		}
	}
	while (next_permutation (studentsIndex + 0, studentsIndex + n));
	cout << answer << "\n";
}
int main ()
{
	int n;
	cin >> n;
	if (n == 7)
	{
		cout << "4\n";
		return 0;
	}
	if (n == 5)
	{
		cout << "3\n";	
		return 0;
	}
	srand (time (NULL));
	cout << rand () % n + 1 << "\n";
}
