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 C (Clang 10.0.0) (judge verdict: Wrong Answer)

#include <stdio.h>

int main()
{
	long long n;
	scanf("%lld", &n);
	long long a[n];
	long long b[n];
	long long i = 1;
	while (i < n)
		scanf("%lld", &a[i++]);
	a[0] = a[1] - 1;
	i = 0;
	long long j;
	long long x = 1;
	while (i < n - 1)
	{
		b[i] = 0;
		j = x;
		while (j < n)
		{
			if (a[i] < a[j] && !(a[j + 1] < a[j]))
			{
				b[i] += 1;
				if (a[j] < a[j + 1])
				{
					x = j + 1;
					break;
				}
			}
			j++;
		}
		printf("%lld\n", b[i]);
		i++;
	}
	printf("0\n");
	return 0;
}