Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

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

Unknown Language Round #4:

- Befunge

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 tag edit access

I. Array sorting

time limit per test

2 secondsmemory limit per test

64 megabytesinput

standard inputoutput

standard outputSorting 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

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/22/2019 20:07:15 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|