#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int n;
int i,j,x,o,s;
int maxx=-1;
int a[n+1];
int b[100001];
for(o=0;o<=100001;o++){
b[o]=0;
}
cin>>n;
for(i=1;i<=n;i++){
cin>>a[i];
}
for(j=1;j<=n;j++){
if(a[j]>maxx){
maxx=a[j];
}}
for(x=1;x<=n;x++){
b[a[x]]++;
}
for(s=0;s<=maxx;s++){
printf("%d\n",b[s]);
}
return 0;
}
为什么一半wa一半re