Sorting arrays is traditionally associated with high-level languages. How hard can it be in Befunge? 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 60, 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
60
1
60
1
60
1
60
1
60
1


Output

1 1 1 1 1 60 60 60 60 60

Source: codeforces | Difficulty: HARD
Tags: Sorting


Solutions: