#include <bits/stdc++.h>
using namespace std;
template <class T>
class BIT {
 public:
  int BIT_size;
  vector<T> BIT_array;
  BIT(int BIT_size) {
    this->BIT_size = BIT_size;
    BIT_array = vector<T>(BIT_size + 1);
    fill(BIT_array.begin(), BIT_array.end(), 0);
  }
  void BIT_update(int i, T d) {
    for (; i <= BIT_size; i += (i & -i)) {
      BIT_array[i] += d;
    }
  }
  T BIT_sum(int i) {
    T BIT_sum_result = 0;
    for (; i > 0; i -= (i & -i)) {
      BIT_sum_result += BIT_array[i];
    }
    return BIT_sum_result;
  }
};
long long pow(long long a, long long b, long long m) {
  a %= m;
  long long result = 1;
  while (b > 0) {
    if (b & 1) {
      result = result * a % m;
    }
    a = a * a % m;
    b /= 2;
  }
  return result;
}
int main() {
  int n;
  cin >> n;
  int f[n + 1];
  memset(f, 0, sizeof(f));
  while (n--) {
    int t;
    cin >> t;
    f[t]++;
  }
  for (int i = 2; i <= n; i++) cout << f[i] << " ";
  cout << "\n";
}
