Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only 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

F. Crunching Numbers Just for You

time limit per test

2 secondsmemory limit per test

64 megabytesinput

standard inputoutput

standard outputYou are developing a new feature for the website which sells airline tickets: being able to sort tickets by price! You have already extracted the tickets' prices, so there's just the last step to be done...

You are given an array of integers. Sort it 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.

Example

Input

3 3 1 2

Output

1 2 3

Note

Remember, this is a very important feature, and you have to make sure the customers appreciate it!

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/21/2020 00:04:12 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|