import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] A = new int[N-1];
		int[] count = new int[N];
		Arrays.fill(count, 0);
		for(int i = 0;i < N-1;i++){
			A[i] = sc.nextInt();
		}
		sc.close();
		count[0]++;
		for(int i = 1;i < N-1;i++){
			if(A[i-1]==A[i]){
				count[A[i-1]-1]++;
			}else{
				count[A[i]-1]++;
			}
		}
		for(int num : count){
			System.out.println(num);
		}
	}

}
/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