题目描述
Sorting arrays is traditionally associated with high-level languages. How hard can it be in Befunge? Sort the given array in non-descending order.
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.
输入格式
见题面 Input 部分
输出格式
见题面 Output 部分
样例输入
5
7
1
9
7
3
样例输出
1 3 7 7 9