#include <algorithm>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cmath>
using namespace std;

#define FOR(i,s,e) for (int i = int(s); i != int(e); i++)
#define FORIT(i,c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define ISEQ(c) (c).begin(), (c).end()

int main(){
	int count[6] ={};
	int N;
	cin >> N;
	FOR(i,0,N){
		int p;
		cin >> p;
		count[p-1]++;
	}

	int maxc = -1;
	int ans = -1;
	FOR(i,0,6){
		if (maxc <=  count[i]){
			maxc = count[i];
			ans = i+1;
		}
	}
	cout << ans << endl;
}