Problem Statement:
"GTX" is an online game where you have many missions each of them is in a different place. One only need to finish all missions in order from the nearest to the farthest.
Input Format:
Given N the number of missions, followed by N numbers each number represent the distance of each mission
0 < N < 101
I guarantee each distance will fit into integer
Output Format:
print the N numbers sorted in ascending order and each number in a line
Sample Input:
5 3 23 1 6 9
Sample Output:
1
3
6
9
23
Added by:

gammal

Added at:

20150213 23:16:03 UTC

Time Limit:

1 second

Partial score:

No
