Gravity Flip Problem !!!

 PROBLEM 26: Gravity Flip

Problem reference : Codeforces 

Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.

There are n columns of toy cubes in the box arranged in a line. The i-th column contains ai cubes. At first, the gravity in the box is pulling the cubes downwards. When Chris switches the gravity, it begins to pull all the cubes to the right side of the box. The figure shows the initial and final configurations of the cubes in the box: the cubes that have changed their position are highlighted with orange.

Input:

The first line of input contains an integer n (1 ≤ n ≤ 100), the number of the columns in the box. The next line contains n space-separated integer numbers. The i-th number ai (1 ≤ ai ≤ 100) denotes the number of cubes in the i-th column.

Output:

Output n integer numbers separated by spaces, where the i-th number is the amount of cubes in the i-th column after the gravity switch.

Solution: 

1. n = int(input())
2. l = []
3. l2 = []
4. x = [int(x) for x in input().split()]
5. l.append(x)
6. for i in l:
7. for j in i:
8. l2.append(j)
10. l2.sort()
11. for i in l2:
12. print(i,"",end='')

The above solution is in python language.

Examples

input

4
3 2 1 2

output

1 2 2 3 

input

3
2 3 8

output

2 3 8