import java.util.Scanner;
import java.util.SortedMap;
import java.util.TreeMap;

public class Main {

	static Main instance = new Main();

	public static void main(String[] args) {

		Scanner scan = new Scanner(System.in);

		//入力値
		int N = scan.nextInt();
		int[] A = new int[N - 1];

		for (int i = 0; i < N - 1; i++) {
			A[i] = scan.nextInt();
		}

		//WK変数
		SortedMap<Integer, Integer> map = new TreeMap<>();

		for (int i = 0; i < N; i++) {
			map.put(i + 1, 0);
		}

		//演算
		for (int i = 0; i < N - 1; i++) {
			map.put(A[i], map.get(A[i]) + 1);
		}

		//結果出力
		for (int i = 0; i < N; i++) {
			System.out.println(map.get(i + 1));
		}
	}
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz