def insertion_sort(arr): for i in range(1, len(arr)): key = arr[i] j = i - 1 while j >= 0 and arr[j] > key: arr[j + 1] = arr[j] j -= 1 arr[j + 1] = key return arr n = int(input()) data = list(map(int, input().split())) sorted_data = insertion_sort(data) print(' '.join(map(str, sorted_data)))