#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
	int n;
	cin >> n;
	int ans = 0;
	int lv[6] = {0};
	int hyou = 0;
	REP(i,n){
		int tmp;
		cin >> tmp;
		lv[tmp-1] += 1;
	}
	REP(i,6){
		if(lv[i] >= hyou){
			ans = i + 1;
			hyou = lv[i];
		}
	}
	cout << ans << endl;
	return 0;
}