The following languages are only available languages for the problems from the contest

Surprise Language Round #7:

- FALSE

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tags yet

No tag edit access

H. Array Sorting

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputSorting 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 ≤ *a*_{i} ≤ 100).

Output

Output space-separated elements of the sorted array.

Examples

Input

3 3 1 2

Output

1 2 3

Input

7 12 2 3 44 5 60 2

Output

2 2 3 5 12 44 60

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/30/2017 23:23:29 (p1).

Desktop version, switch to mobile version.
User lists

Name |
---|