n=int(input())
a=map(int,input().split())
a=list(a)
def partition(a,l,r):
    i=l
    j=r
    piovt=a[l]
    while i!=j:
        while i<j and a[j]>piovt:
            j-=1
        while i< j and a[i]<=piovt:
            i+=1
        if i<j:
            a[i],a[j] = a[j],a[i]
    a[l],a[i]=a[i],a[l]
    return i

def quicksort(a,l,r):
    if l>=r:
        return
    piovt_idx=partition(a,l,r)
    quicksort(a,l,piovt_idx-1)
    quicksort(a,piovt_idx+1,r)

quicksort(a,0,n-1)
for i in a:
    print(i,end=" ")