#include<iostream>
#include<algorithm>
#include<set>


using namespace std;

int main() {
	multiset<int>m;
	long long n,b=0,a=0,maxi=0,t=0;
	cin >> n;
	for (long long i = 0; i < n; i++) {
		cin >> b;
		m.insert(b);
	}

	for (long long i = 1; i < 6; i++) {
		a = m.count(i);
		if (a > maxi) {
			maxi = a;
			t = i;
		}
		else if (a == maxi) {
			t = min(t, i);
		}
	}

	cout << t;
	return 0;

}