Digit Frequency Count

We are given a non-negative integer (n). Your task is to compute the frequency of each digit in (n). Return an array of 10 integers, where the (i)-th integer (for (i=0,1,...,9)) represents the count of digit (i) in (n).

For example, if (n = 112233), the result is [0, 2, 2, 2, 0, 0, 0, 0, 0, 0].

inputFormat

A single non-negative integer is provided via standard input (stdin). The integer may be large and will be given as a single line.

outputFormat

Print 10 space-separated integers on one line. The (i)-th number in the output should represent the count of digit (i) in the input number.## sample

112233

0 2 2 2 0 0 0 0 0 0