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: Wrong Answer)

using System;
using System.IO;
using System.Linq;
using System.Collections.Generic;
using System.Text;
using System.Numerics;

namespace abc163
{
    class Program
    {
        static void Main(string[] args)
        {
            Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
            if (File.Exists("input.txt"))
            {
                Console.SetIn(new StreamReader("input.txt"));
            }
			solve_abc163C();
			Console.Out.Flush();
        }

        public static void solve_abc163C()
        {
            int n = Convert.ToInt32(Console.ReadLine());
            int[] a = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
            int prev = a.Length > 1 ? a[0] != a[1] ? a[1] : a[0] : a[0];
            int cnt = a.Length > 1 ? a[0] != a[1] ? 1 : 0 : 0;
            List<int> children = new List<int>();
            for (int i = 0; i < a.Length; i++)
            {
                if (a[i] == prev)
                {
                    cnt++;
                }
                
                if (a[i] != prev || i == a.Length - 1)
                {
                    children.Add(cnt);
                    cnt = 1;

                }
                prev = a[i];
            }

            for (int i = 0; i < n; i++)
            {
                if (i < children.Count)
                {
                    Console.WriteLine(children[i]);
                }
                else
                {
                    Console.WriteLine(0);
                }
            }
        }

        public static void solve_abc163B()
        {
            int[] nm  = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
            int n = nm[0];
            int m = nm[1];
            int[] a = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
            long sum = 0;
            for (int i = 0; i < m; i++)
            {
                sum += a[i];
            }
            Console.WriteLine(sum <= n ? n - sum : -1);
        }

        public static void solve_abc163A()
        {
            int r = Convert.ToInt32(Console.ReadLine());
            Console.WriteLine(2 * Math.PI * r);
        }
    }
}