#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int a[5] = {1,2,3,4,5};
    vector<int> vec;
	long n, max=0, tmp, result;
	int x;
	cin >> n;
	for(long i=0; i<n; i++){
		cin >> x;
		vec.push_back(x);
	}   
	sort(vec.begin(), vec.end());
	
	for(int i=0; i<5; i++){
		tmp=0;
		for(long j=0; j<vec.size(); j++){
			if(vec[j] == a[i]){
				tmp++;
			}
		}
		if(tmp > max){
			max = tmp;
            result = a[i];
		}
	}
	cout << result;
    return 0;
}