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


int main() {
    int n;
    cin >> n;
    vector<int> birds(n);
    map<int,int> counter;
    for(int i =0; i < n; i++){
        cin >> birds[i];
    }
    for(int i = 1; i < 6; i++){
        counter[i] = count(birds.begin(),birds.end(),i);
    }
    cout << (*max_element(counter.begin(),counter.end(), [](const pair<int, int>& p1, const pair<int, int>& p2) {
        return p1.second < p2.second; })).first;
    return 0;
}