favorite We need a little bit of your help to keep things running, click on this banner to learn more

Tricky Sorting

Tricky Sorting

The sequence of numbers is given. Arrange them in non-decreasing order of the last digit, and in the case of equality of last digits - arrange the numbers in non-decreasing order.


The first line contains number n (1n100), and the second line contains the positive integers not greater than 32000.


Print the sequence of numbers ordered as given in problem statement.

Time limit 1 second
Memory limit 128 MiB
Input example #1
12 15 43 13 20 1 15
Output example #1
20 1 12 13 43 15 15