def optimized_bubble_sort(arr): n = len(arr) for i in range(n): swapped = False for j in range(0, n-i-1): if arr[j] < arr[j+1]: arr[j], arr[j+1] = arr[j+1], arr[j] swapped = True if not swapped: break return arr n = int(input()) data = list(map(int, input().split())) sorted_data = optimized_bubble_sort(data) print(' '.join(map(str, sorted_data)))