//python快速排序模板
N=int(input())
nums=[int(x) for x in input().split()]
def quick_sort(arr,l,r):
    if l>=r:
        return 
    x,i,j=arr[(l+r)//2],l-1,r+1
    while i < j:
        while 1:
            i += 1
            if arr[i] >= x:
                break
        while 1:
            j -= 1
            if arr[j] <= x:
                break
        if i < j:
            arr[i], arr[j] = arr[j], arr[i]
    quick_sort(arr,l,j)
    quick_sort(arr,j+1,r)
quick_sort(nums,0,N-1)
for i in nums:
    print(i,end=' ')