#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
ll mod(ll a) { return a % 1000000007; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
int main() {
  ll n;
  cin >> n;
  vl num(n + 1);
  for (ll i = 1; i <= n - 1; i++) {
    ll x;
    cin >> x;
    num[x]++;
  }
  for (ll i = 1; i <= n; i++) {
    cout << num[i] << endl;
  }
}
