#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
	const int levels = 6;
	int n;
	cin >> n;
	vector<int> L(levels);

	for (int i = 0; i < n; i++)
	{
		int j;
		cin >> j;
		L[--j]++;
	}

	int ans;
	int max = 0;
	for (int i = 0; i < levels; i++)
	{
		if (max <= L[i])
		{
			max = L[i];
			ans = i + 1;
		}
	}
	cout << ans << endl;
}