def quick_sort(q, l, r):
    if l >= r: return
    
    i, j, x = l - 1, r + 1, q[l + r >> 1]
    
    while i < j:
        while 1:
            i += 1
            if q[i] >= x: break
        
        while 1:
            j -= 1
            if q[j] <= x: break
    
        if i < j:
            q[i], q[j] = q[j], q[i]
        
    quick_sort(q, l, j), quick_sort(q, j + 1, r)
    

if __name__ == '__main__':
    n = int(input())
    q = [int(i) for i in input().strip().split()]
    quick_sort(q, 0, n - 1)
    
    for i in q:
        print(i, end = ' ')