Digit Frequency Counting

Problem Description

Write a program that reads an indefinite number of integers in the range $[0,9]$, and counts how many times each digit appears. Input terminates with $-1$. At most $10000$ numbers are given.

Input Format

One line containing several integers separated by spaces, terminated by $-1$.

Output Format

A total of $10$ lines. For each digit from $0$ to $9$, output one line in the format:

数字的出现次数：次数

where 数字 is replaced by the digit and 次数 by its count.

Note: the surrounding Chinese characters must be printed exactly as shown above — the judge compares them character by character, so do not translate them in your output.

Sample Input

1 2 3 1 -1

Sample Output

0的出现次数：0
1的出现次数：2
2的出现次数：1
3的出现次数：1
4的出现次数：0
5的出现次数：0
6的出现次数：0
7的出现次数：0
8的出现次数：0
9的出现次数：0

Sample Explanation

The input numbers are $1$, $2$, $3$, $1$ in order; reading stops after $-1$. Counting gives: digit $1$ appears $2$ times, digit $2$ appears $1$ time, digit $3$ appears $1$ time, and the remaining digits do not appear, so their counts are $0$.

Constraints

The number of input integers does not exceed $10000$; each is $-1$ or an integer from $0$ to $9$. The input is guaranteed to end with $-1$, and $-1$ is not counted in the statistics.