bogo-sort-1
Source: hackerearth
Difficulty: EASY

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


arr=[]
T = int(input())
for case in range(T):
	a=int(input().strip())
	arr.append(a)
sort= sorted(arr)
for i in sort:
	print(i)
	
	


#! /usr/bin/python

n = int(input())

lst = [0] * n
for x in range(n):
	lst[x] = int(input())
l = sorted(lst)
for x in l:
	print(x)



c=int(input())
x=[]
d=c
while c>0:
	l=int(input())
	x.append(l)
	c-=1
x.sort()
while x:
	print((x[0]))
	x=x[1:]








arr = []
for _ in range(int(input())):
	arr.append(int(input()))
arr = sorted(arr)
for i in arr:
	print(i)


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

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''

k=[]
for i in range(eval(input())):
	z=int(input())
	k.append(z)
k=sorted(k)
for i in k:
	print(i)
	


n=eval(input())
li=list()
for i in range(n):
	li.append(eval(input()))
li = sorted(li)
for i in li:
	print(i)


lst=[]
for _ in range(eval(input())):
	lst.append(eval(input()))
lst.sort()
for i in lst:
	print(i)


n=input()
l=[]
for i in range(1,int(n)+1):
	r=input()
	l.append(int(r))
l.sort()
for element in l:
	print(element)    




a=int(input());
b=[];
for i in range(a):
	c=int(input());
	b.insert(i,c);
b.sort();
for i in range(a):
	print((b[i]));


lst = []
for i in range(eval(input())):
	lst.append(eval(input()))
lst.sort()
for j in lst:
	print(j)


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

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
a=[]
n=int(eval(input()))
for i in range(n):
	n1=int(eval(input()))
	a.append(n1)
min=a[0]
for i in range(n):
	for j in range(i+1,n):
		if a[j]<a[i]:
			temp=a[i]
			a[i]=a[j]
			a[j]=temp
for i in range(n):
	print((a[i]))


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

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
#print 'Hello World!'

'''
a = []
a.append(100)
a.append(300)
a.append(200)
a.sort()
print a
'''
n = int(input())
i = 0
a = []
while (i < n):
	a.append(int(input()))
	i = i + 1
a.sort()
#print a
for x in a:
	print(x)


times = int(input())
lst = []
for i in range(times):
	num = int(input())
	lst.append(num)

for j in sorted(lst):
	print(j)


t=int(input())
ar=[]
for i in range(t):
	ar.append(int(input()))
ar=sorted(ar)
for i in ar:
	print(i)


arr = []
for _ in range(int(input())):
	arr.append(int(input()))
arr = sorted(arr)
for i in arr:
	print(i)


m=input()
lst=[]
n=int(m)
for i in range(n):
	k=input()
	lst.append(int(k))
lst.sort()
for each in lst:
	print(each)


n=eval(input())
temp=n
arr=[]
while(n>0):
	arr.append(eval(input()))
	n=n-1
arr.sort()
 
for j in range(0,temp):
	print((arr[j]))
 


n = int(input())
l = []
for i in range(n):
	a = int(input())
	l.append(a)
l = sorted(l)
for i in l:
	print(i)


k=eval(input())
p=[]
for i in range(0,k):
	p=p+[eval(input())]
	p=sorted(p)
for i in range(0,len(p)):
	print(p[i]);


n = eval(input())
arr = []
for _ in range(n):
	num = eval(input())
	arr.append(num)
arr.sort()
for i in arr:
	print(i)
	
	



for x in sorted([eval(input()) for t in range(eval(input()))]):
	print(x)


t=int(input());
l=[];
while t!=0:
	t-=1;
	l.append(int(input()));
l.sort();
for i in l:
	print(i)


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

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
#print 'Hello World!'

N = int(input())
list1=[]
for i in range(N):
	list1.append(int(input()))
	
list1.sort()

for i in list1:
	print(i)
	'\n'


num_len = int(input())
all_list = []
for item in range(num_len):
	all_list.append(int(input()))
		        
for i in range(len(all_list)):
    k = i + 1
    if i != len(all_list) - 1:
        for j in range(len(all_list[i+1:])):
            if all_list[i] > all_list[i+1+j]:
                all_list[i], all_list[i+1+j] = all_list[i+1+j], all_list[i]
    print(all_list[i])

			
		
				


from bisect import *
n=int(input())
arr = []
while n>0:
	n-=1
	a = int(input())
	arr.insert(bisect_right(arr,a), a)
for i in arr:
	print(i)



n=eval(input())
temp=n
arr=[]
while n>0:
	arr.append(eval(input()))
	n=n-1
arr.sort()
for j in range(temp):
	print(arr[j])


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

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
t = int(input())
n=[]
i=0
while i<t:
	m = int(input())
	n.append(m)
	i=i+1
	
n.sort()
j=0
	
while j<t:
	print(n[j])
	j=j+1