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# (.NET Core 3.1.201) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace AtCoder
{
    class Program
    {
        static void Main(string[] args)
        {

            int hito = int.Parse(Console.ReadLine());
            string[] input = Console.ReadLine().Split();
            int[] change_input = new int[input.Length];
            change(input, change_input);
            int count = 1;
            int j = 1;
            int kakunin = 0;
            for (int i = 0; i < change_input.Length; i++)
            {
                if (change_input[i] == change_input[j])
                {
                    count++;
                }
                else
                {
                    Console.WriteLine(count);
                    count = 1;
                    kakunin++;
                }
                j++;
                if (j == change_input.Length)
                {
                    Console.WriteLine(count);
                    for(int t = 0; t < change_input.Length - kakunin; t++)
                    {
                        Console.WriteLine(0);
                    }
                    break;
                }
            }
            Console.Read();
        }
        public static void change(string[] x, int[] y)
        {
            for (int i = 0; i < x.Length; i++)
            {
                y[i] = int.Parse(x[i]);
            }
        }
    }
}