Array sorting
Description
Sorting arrays is traditionally associated with high-level languages. How hard can it be in Befunge? Sort the given array in non-descending order.
The first line of input contains an integer n (1 ≤ n ≤ 100) — the size of the array. The following n lines contain the elements of the array, one per line. Each element of the array is an integer between 1 and 60, inclusive. The array might contain duplicate elements.
Output space-separated elements of the sorted array.
Input
The first line of input contains an integer n (1 ≤ n ≤ 100) — the size of the array. The following n lines contain the elements of the array, one per line. Each element of the array is an integer between 1 and 60, inclusive. The array might contain duplicate elements.
Output
Output space-separated elements of the sorted array.
5<br>7<br>1<br>9<br>7<br>3<br>
10<br>60<br>1<br>60<br>1<br>60<br>1<br>60<br>1<br>60<br>1<br>
1 3 7 7 9 <br>
1 1 1 1 1 60 60 60 60 60 <br>