eolymp
bolt
Try our new interface for solving problems
Problems

The Imperial March

The Imperial March

This time, the Emperor came up with a revision, not into any hangar, but into the barracks of the 501th legion of the Imperial Stormtroopers. Thereby each Stormtrooper was cut "under the hedgehog". Despite the development of nanotechnology, the haircut was bad - as a result, due to differences in hair length, the Stormtroopers may differ from each other in height, but slightly - the difference does not exceed 137 nanometers. Your task is to order the Imperial Stormtroopers by height.

Input

First line contains the number of Imperial Stormtroopers n (1n100000), second line contains n positive integers not exceeding 2 * 109 - the Stormtrooper's growth in nanometers. No two growths differ more than 137 nm.

Output

Print the growth of Imperial Stormtroopers in nanometers in nondecreasing order.

Time limit 1 second
Memory limit 128 MiB
Input example #1
5
12 1 2 1 13
Output example #1
1 1 2 12 13
Input example #2
1
1000000000
Output example #2
1000000000