#include <iostream>
#include <algorithm>
using namespace std;
int main(){
    int a[100005],cnt[100005],n,max = 0,i;
    cin >> n;
    for (i = 0;i < n;i++){
        cin >> a[i];
        if (max < a[i]){max = a[i];}
    }
    sort(a,a+i,greater<int>());
    for (i = 0;i < n;i++){
        if (a[i] <= max){
            cnt[a[i]]++;
        }
    }
    for (i = 0;i <= max;i++){
        cout << cnt[i] << endl;
    }
    return 0;
}
本地是没问题的