#include <iostream>
#include <vector>
#include <utility>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <map>
using namespace std;



double dis(int i, int j, const vector<pair<int,int>> & pos ){
    return sqrt(pow(pos[i].first-pos[j].first,2)+pow(pos[i].second-pos[j].second,2));
}

int main(){
    long n;
    map<long,long> pr;
    cin >> n ;
    
    for(long i=1; i<n; i++){
        long tmp;
        cin >> tmp;
        pr[tmp]++;
    }
    for(long i=1;i<n+1;i++){
        if(pr.count(i)){
            cout << pr[i] << endl;
        }else{
            cout << 0 << endl;
        }
    }

    return 0;
}