#include <bits/stdc++.h>
using namespace std;
int n, Fmax;
int a[11234];
int cnt[11234]; //cnt[x]: x 的出现次数 
int main()
{
	//输入 
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    //求 Fmax 
    Fmax = -1;
    for (int i = 1; i <= n; i++)
        Fmax = max(Fmax, a[i]);
    //统计每个数的出现次数 
    for (int i = 1; i <= n; i++)
        cnt[a[i]]++;//给 a[i] 的出现次数加 1
	//输出 0~Fmax 每个数的出现次数		 
    for (int i = 0; i <= Fmax; i++)
        cout << cnt[i] << "\n";
    return 0;
}