#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
#define rep(i,x) for(int i=0;i<(int)(x);i++)

int main(){
	int n, m, ans, max = 0, l[6] = { 0 };
	cin >> n;
	rep(i, n) {
		cin >> m;
		++l[m-1];
	}
	rep(i,6) {
		if (l[i] >= max) {
			max = l[i];
			ans = i;
		}
	}
	cout << ans+1 << endl;
	return 0;
}