#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
	int numBirds;
	cin >> numBirds;
	vector<int> niceVec(5, 0);
	for(int i = 0; i < numBirds; ++i) {
		int temp;
		cin >> temp;
		temp -= 1;
		niceVec[temp] += 1;
	}

	int bestIndex = 0;
	int biggest = -1;
	for(int i = 0; i < niceVec.size(); ++i) {
		if(niceVec[i] > biggest) {
			bestIndex = i;
			biggest = niceVec[i];
		}
	}

	cout << bestIndex + 1 << endl;
}