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

int max(int *arr){
    int max=0,i;
    for(i=1;i<5;i++){
        if(arr[i]>arr[max])
            max=i;
        i++;
    }
    return max;
}

int main() {
    int i=0,ty=1,n,type[20],count[5]={0,0,0,0,0};
    cin>>n;
    for(i=0;i<n;i++)    cin>>type[i];
    while(ty<=5){
        for(i=0;i<n;i++){
            if(ty==type[i])  count[ty-1]+=1;
        }
        ty++;
    }
    int m=max(count);
    cout<<m+1<<flush;    
    return 0;
}