#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
  ll N;
  cin >> N;
  map<ll, ll> hyou;
  for (ll j = 0; j < N; j++) {
    hyou[j] = 0;
  }
  ll a[N - 1];
  for (ll i = 0; i < N - 1; i++) {
    cin >> a[i];
    if (a[i] != 0) {
      hyou[a[i] - 1]++;
    }
  }
  for (ll j = 0; j < N; j++) {
    cout << hyou[j] << endl;
  }
  return 0;
}
