一本通1067

//qf
#include <bits/stdc++.h>
#define f(i,j,n) for(register int i=j;i<=n;i++)
using namespace std;
typedef long long ll;
inline ll read(){
    ll x=0;
    int f=1;
    char ch=getchar();
    while(!isdigit(ch)) {
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(isdigit(ch)) x=(x<<1)+(x<<3)+ch-48,ch=getchar();
    return x*f;
}
int k=read();
ll s1=0,s2=0,s3=0;
signed main(){
    f(i,1,k) {
        ll x=read();
        if(x==1) s1++;
        if(x==5) s2++;
        if(x==10) s3++;
    }
    cout<<s1<<endl<<s2<<endl<<s3<<endl;
    return 0;
}