I. Array sortingtime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputSorting arrays is traditionally associated with high-level languages. How hard can it be in Befunge? Sort the given array in non-descending order.InputThe 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.OutputOutput space-separated elements of the sorted array.ExamplesInput571973Output1 3 7 7 9 Input10601601601601601Output1 1 1 1 1 60 60 60 60 60 
Input571973
Output1 3 7 7 9 
['*special problem', 'sortings', '*2300']