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