def quick_sort(arr):
    if len(arr) <= 1:
        return arr
    pivot = arr[len(arr) // 2]
    left = [x for x in arr if x < pivot]
    middle = [x for x in arr if x == pivot]
    right = [x for x in arr if x > pivot]
    return quick_sort(left) + middle + quick_sort(right)

def main():
    n = int(input().strip())
    numbers = list(map(int, input().strip().split()))
    sorted_numbers = quick_sort(numbers)
    print(' '.join(map(str, sorted_numbers)))

if __name__ == "__main__":
    main()