#include<stdio.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <string>
#include <stdio.h>

using namespace std;

int main() {

	int N, L[6] = {};
	cin >> N;
	for (int i = 0; i < N; i++) {
		int t;
		cin >> t;
		L[t - 1]++;
	}

	int m = 0, num = -1;
	for (int i = 5; i >= 0; i--) {
		if (L[i] > m) m = L[i], num = i;
	}

	cout << num+1 << endl;

	return 0;
}