H. Array Sortingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSorting arrays is traditionally associated with high-level languages. How hard can it be in FALSE? Sort the given array in non-descending order.InputThe input consists of a single line of space-separated integers. The first number is n (1 ≤ n ≤ 10) — the size of the array. The following n numbers are the elements of the array (1 ≤ ai ≤ 100).OutputOutput space-separated elements of the sorted array.ExamplesInput3 3 1 2Output1 2 3 Input7 12 2 3 44 5 60 2Output2 2 3 5 12 44 60 
Input3 3 1 2
Output1 2 3 
['*special problem', '*2300']