#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n;
    cin >>n;
    int temp;
    vector<int> vec;
    for (int i = 0; i < n; ++i) {
        cin >> temp;
        vec.push_back(temp);
    }
    sort(vec.begin(),vec.end());

    auto itr = vec.begin();
    int a = 1;
    vector<int> b(6, 0);
    while (1) {
        find(itr, vec.end(), a);
        if (*itr != a) a++;
        else {
            b.at(a - 1)++;
            itr++;
        }
        if (itr == vec.end()) break;
    }
    auto max = max_element(b.rbegin(), b.rend());
    cout << distance(max, b.rend()) <<endl;
    return 0;
}