#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
    if(y == 0) return x;
    else return GCD(y,x%y);
}

int main() {
    int N;
    cin >> N;
    vector<int> vec;
    int B;
    for(int i = 0;i < N-1;++i){
        cin >> B;
        vec.push_back(B);
    }
    
    for(int i = 0;i < N-1;++i){
        cout << count(vec.begin(),vec.end(),i+1) << endl;
    }
    cout << 0 << endl;
}

