ABC163——Task C：management - Problem

Problem5321--ABC163——Task C：management

5321: ABC163——Task C：management

_{[Creator : ]}

Time Limit : 1.000 sec Memory Limit : 256 MiB

Submit Solved: 4 Submit Num: 4 Statistics ShowOff!

Description

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 $_{i}$ . For each member, find how many immediate subordinates it has.

Input

Input is given from Standard Input in the following format:

N
A₂ ... A_N

Output

For each of the members numbered

1, 2, . . ., N

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

Constraints

$2 \leq N \leq 2 \times^{5}$
$1 \leq_{i} < i$

Sample 1 Input

5
1 1 2 2

Sample 1 Output

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 2 Input

10
1 1 1 1 1 1 1 1 1

Sample 2 Output

Sample 3 Input

7
1 2 3 4 5 6

Sample 3 Output

HINT

AtCoder Beginner Contest 163，Task C。https://atcoder.jp/contests/abc163/tasks/abc163_c

Source/Category

AtCoder_ABC 100.163.ABC163

Submit

5321: ABC163——Task C：management

Description

Input

Output

Constraints

Sample 1 Input Copy

Sample 1 Output Copy

Sample 2 Input Copy

Sample 2 Output Copy

Sample 3 Input Copy

Sample 3 Output Copy