PROGRAMMING:Find the most digits in a batch of integers
Given a batch of integers, analyze each digit of each integer to find the most frequent digit. For example, given three integers 1234, 2345 and 3456, the number with the largest number of occurrences is 3 and 4, both of which occur three times.
###Input format:
Enter the positive integer $$n $$($$Le 1000 $$) in the first line and $$n $$non negative integers that do not exceed the integer range in the second line, separated by spaces.
###Output format:
Output in one line according to the format "m: N1, N2...", where m is the maximum number of times, N1, N2,... Are the most frequent digits, arranged from small to large. The numbers are separated by spaces, but there should be no extra spaces at the end.
###Input example:
```in
three
1234 2345 3456
```
###Output example:
```out
3: 3 4
```
answer：If there is no answer, please comment
###Input format:
Enter the positive integer $$n $$($$Le 1000 $$) in the first line and $$n $$non negative integers that do not exceed the integer range in the second line, separated by spaces.
###Output format:
Output in one line according to the format "m: N1, N2...", where m is the maximum number of times, N1, N2,... Are the most frequent digits, arranged from small to large. The numbers are separated by spaces, but there should be no extra spaces at the end.
###Input example:
```in
three
1234 2345 3456
```
###Output example:
```out
3: 3 4
```
answer：If there is no answer, please comment