fin = open("algsort.in", 'r')
fout = open("algsort.out", 'w')
n = fin.readline()
n = int(n)
lista = []
new = []
lista.append(fin.read().split())
while n > 0:
    new.append(int(lista[0][n - 1]))
    n -= 1
new.reverse()


def sortare(new):
    finish = False
    l = len(new)
    while not finish:
        swap = False
        for i in range(0, l - 1):
            if new[i] > new[i + 1]:
                new[i], new[i + 1] = new[i + 1], new[i]
                swap = True
        if swap is True:
            l -= 1
        else:
            finish = True


sortare(new)
fout.write(str(new))
fin.close()
fout.close()