#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <iomanip>
#include <map>
#include <set>
#include <tuple>
#include <unordered_map>
#include <iterator>
#include <string>
#include <limits>

using namespace std;

using i64 = int64_t;
using P = pair<i64, i64>;
i64 mod = 1000000007;
int int_max = 2147483647;
int max_n = 1e5;


int main(int argc, char **argv) {
    int n;
    cin >> n;

    std::vector<int> as(n+1,0);
    std::vector<int> sub(n+1, 0);
    for (int i=2; i<n+1; ++i) {
        cin >> as[i];
        ++sub[as[i]];
    }

    for (int i=1; i<n+1; ++i) {
        cout << sub[i] << endl;
    }

    return 0;
}