| # 188_G. Array Sorting | |
| ## Problem Description | |
| Sorting arrays is traditionally associated with high-level languages. How hard can it be in Roco? 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 100, inclusive. The array might contain duplicate elements. | |
| Output | |
| Output space-separated elements of the sorted array. | |
| Examples | |
| Input | |
| 5 | |
| 7 | |
| 1 | |
| 9 | |
| 7 | |
| 3 | |
| Output | |
| 1 3 7 7 9 | |
| Input | |
| 10 | |
| 100 | |
| 1 | |
| 100 | |
| 1 | |
| 100 | |
| 1 | |
| 100 | |
| 1 | |
| 100 | |
| 1 | |
| Output | |
| 1 1 1 1 1 100 100 100 100 100 | |
| ## Contest Information | |
| - **Contest ID**: 188 | |
| - **Problem Index**: G | |
| - **Points**: 0.0 | |
| - **Rating**: 1600 | |
| - **Tags**: *special, implementation | |
| - **Time Limit**: {'seconds': 2, 'nanos': 0} seconds | |
| - **Memory Limit**: 256000000 bytes | |
| ## Task | |
| Solve this competitive programming problem. Provide a complete solution that handles all the given constraints and edge cases. |