Problem: Given an array A of N integers, sort them in non-decreasing order.
Input Format

The first line of the input file contains a positive integer <N.
Then, N lines follow, each containing a single integer Ai, which is the i^th element of A.

Output Format

The output must contain exactly N lines, each line containing a single integer from the list, and sorted in non-increasing order.

Constraints

1 ≤ N ≤ 10,000
-10^6 ≤ Ai ≤ 10^6

SAMPLE INPUT
8
567
23
-10982
1000000
-999999
-3456
1729
65535

SAMPLE OUTPUT
-999999
-10982
-3456
23
567
1729
65535
1000000

Solution (in PYTHON):

Solution:
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
a=input()
b=[]
for i in range(0,a):
	r=input()
	b.append(r)
for i in range(0,a):
	for j in range(i,a):
		if(b[i]>b[j]):
			c=b[i]
			b[i]=b[j]
			b[j]=c
for i in range(0,a):
	print(b[i])