#P188G. Array Sorting

    ID: 8867 Type: RemoteJudge 2000ms 256MiB Tried: 0 Accepted: 0 Difficulty: 5 Uploaded By: Tags>*special problemimplementation*1600

Array Sorting

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.

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 space-separated elements of the sorted array.

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.

5
7
1
9
7
3

10
100
1
100
1
100
1
100
1
100
1

1 3 7 7 9 

1 1 1 1 1 100 100 100 100 100