PROGRAMMING:Chain radix sort
Realize the chain cardinality sorting, the keyword n to be sorted meets 1 ≤ n ≤ 1000, and the maximum number of keywords is ≤ 5.
###Input example:
In the first line, enter the number n to be sorted (1 ≤ n ≤ 1000), and then enter n numbers (n digits ≤ 5).
```in
ten
278 109 63 930 589 184 505 269 8 83
```
###Output example:
Output the keywords in the linked list after each allocation collection. The number of times is the number of digits of the maximum value in the sequence (for example, the number of 930 in the example is 3). There is a space at the end of each line.
```out
930 63 83 184 505 278 8 109 589 269
505 8 109 930 63 269 278 83 184 589
8 63 83 109 184 269 278 505 589 930
```
answer：If there is no answer, please comment
###Input example:
In the first line, enter the number n to be sorted (1 ≤ n ≤ 1000), and then enter n numbers (n digits ≤ 5).
```in
ten
278 109 63 930 589 184 505 269 8 83
```
###Output example:
Output the keywords in the linked list after each allocation collection. The number of times is the number of digits of the maximum value in the sequence (for example, the number of 930 in the example is 3). There is a space at the end of each line.
```out
930 63 83 184 505 278 8 109 589 269
505 8 109 930 63 269 278 83 184 589
8 63 83 109 184 269 278 505 589 930
```
answer：If there is no answer, please comment