Problem:
Score : 300 points

Problem Statement

A company has N members, who are assigned ID numbers 1, ..., N.

Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.

When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.

You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.

Constraints

2 \leq N \leq 2 \times 10^5

1 \leq A_i < i

Input

Input is given from Standard Input in the following format:

N
A_2 ... A_N

Output

For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.

Sample Input 1

5
1 1 2 2

Sample Output 1

2
2
0
0
0

The member numbered 1 has two immediate subordinates: the members numbered 2 and 3.

The member numbered 2 has two immediate subordinates: the members numbered 4 and 5.

The members numbered 3, 4, and 5 do not have immediate subordinates.

Sample Input 2

10
1 1 1 1 1 1 1 1 1

Sample Output 2

9
0
0
0
0
0
0
0
0
0

Sample Input 3

7
1 2 3 4 5 6

Sample Output 3

1
1
1
1
1
1
0

Solution in Java (OpenJDK 11.0.6) (judge verdict: Runtime Error)

import java.io.PrintWriter;
import java.util. *;



	
class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long N = sc.nextInt(); sc.nextLine();
        String a = sc.nextLine();
//        StringBuilder sb = new StringBuilder();
//        for(int i=0;i<N-1;i++) {
//            sb.append(sc.next());
//        }
//        String a = sb.toString();
         
//        String a = "";
//        for (int i = 0; i < N-1; i++) {
//			a = a + sc.next();
//		}
//      
       
        long i = 0;
        long j = 0;
//        long[] ans = new long[N];
        ArrayList<Long> ans = new ArrayList<Long>();
//        ArrayList<Long> b = new ArrayList<Long>();
        while (i < N - 1) {
        	long temp_sum = a.length();
			a = a.replaceAll(String.valueOf(j+1), "");
			ans.add(temp_sum - a.length());
			i += temp_sum - a.length(); 
			j += 1;
		}
        
        for (int k = 0; k < N - ans.size()+1; k++) {
			ans.add(0L);
		}
        PrintWriter out = new PrintWriter(System.out);
        for (int k = 0; k < N; k++) {
			System.out.println(ans.get(k));
		}
        out.flush();
	}
}