Problem Statement

On the Discord server "Asakatsu", when a person declares a color, the declarer gets colored with that color (by hibit, through warm, heartfelt manual labor).

A person colored with color $C$ in this way is called a "$C$ coder".

As input, you are given $N$ declarations (the declarer's name $S_i$ and the color $C_i$) in chronological order. Answer how many coders of each color there are.

If the same declarer makes multiple declarations, the newer declaration (the one made later) takes priority.

Also, there are no $2$ or more declarers with the same name.

We would like to say that the colors are, from lowest to highest, gray,brown,green..., but the problem setter does not like imposing such implementation unrelated to the logic, so for simplicity, here there are $8$ colors $0,1,...,7$ from lowest to highest.

Input

$N \\
    S_1\ C_1 \\
    S_2\ C_2 \\
    \vdots \\
    S_{N}\ C_{N}$ 

• $N$ is an integer $(1 \leq N \leq 2 \cdot 10^3)$
• $S_i$ is a string representing the declarer's name $(1 \leq |S_i| \leq 2 \cdot 10^2)$
• $S_i$ consists only of lowercase or uppercase letters.
• $C_i$ is an integer representing the color $(0 \leq C_i \leq 7)$

Output

The output consists of 8 lines of integers. On line $1$, line $2$, $\dots$, line $8$, output the number of coders corresponding to colors $0,1,...,7$, respectively.

Sample

3
hibit 3
KowerKoint 5
Michirakara 1

0
1
0
1
0
1
0
0

4
Michirakara 1
Michirakara 2
hibit 3
hibit 2

0
0
2
0
0
0
0
0