#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pr;

int N;
int l[7];

int main()
{
	cin >> N;
	for (int i = 0; i < N; i++) {
		int L; cin >> L;
		l[L]++;
	}

	int mx = 0,mx_l = 0;
	for (int i = 6; i >= 1; i--) {
		if (mx < l[i]) {
			mx = l[i];
			mx_l = i;
		}
	}
	cout << mx_l << endl;
	return	0;
}