#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
	int n;
	cin >> n;
	vector<int> a(6, 0);
	vector<int> b(6);
	for (int i = 0; i < n; i++) {
		int k;
		cin >> k;
		switch (k)
		{
		case 1:
			a[0]++;
			break;
		case 2:
			a[1]++;
			break;
		case 3:
			a[2]++;
			break;
		case 4:
			a[3]++;
			break;
		case 5:
			a[4]++;
			break;
		case 6:
			a[5]++;
			break;
		}
	}
	b[0] = a[0]; b[1] = a[1]; b[2] = a[2]; b[3] = a[3]; b[4] = a[4]; b[5] = a[5];
	sort(b.begin(), b.end());
	for (int i = 5; i >= 0; i--) {
		if (a[i] == b[5]) {
			cout << i + 1 << endl;
			return 0;
		}
	}
}