PROGRAMMING:Individual statistics
Given an integer $$n $$, count the number of times each different digit appears. For example, given $$n $$= $$100811 $$, there are $$2 $$0 $, $$3 $$1 $, $$1 $$8 $$.
###Input format:
Enter an integer $$n $$that does not exceed the range of long integers.
###Output format:
For each different digit in $$n $, output the digit'd 'and its number of occurrences'm' in a row in the format of'd: M '. It is required to output in ascending order of'd '.
###Input example:
```in
one hundred thousand eight hundred and eleven
```
###Output example:
```out
0:2
1:3
8:1
```
answer：If there is no answer, please comment
###Input format:
Enter an integer $$n $$that does not exceed the range of long integers.
###Output format:
For each different digit in $$n $, output the digit'd 'and its number of occurrences'm' in a row in the format of'd: M '. It is required to output in ascending order of'd '.
###Input example:
```in
one hundred thousand eight hundred and eleven
```
###Output example:
```out
0:2
1:3
8:1
```
answer：If there is no answer, please comment