text: def countingSort(arr):
  	max_element = int(max(arr))
  	min_element = int(min(arr))
  	range_of_elements = max_element - min_element + 1
  
  	count_arr = [0 for _ in range(range_of_elements)]
  	output_arr = [0 for _ in range(len(arr))]
  
  	for i in range(0, len(arr)):
  		count_arr[arr[i]-min_element] += 1
  
  	for i in range(1, len(count_arr)):
  		count_arr[i] += count_arr[i-1]
  
  	for i in range(len(arr)-1, -1, -1):
  		output_arr[count_arr[arr[i] - min_element] - 1] = arr[i]
  		count_arr[arr[i] - min_element] -= 1
  
  	for i in range(0, len(arr)):
  		arr[i] = output_arr[i]
  
  	return arr
  
  if __name__ == '__main__':
  	arr = list(map(int, '63 25 73 1 98 73 56 84 86 57 16 83 8 25 81 56 9 53 98 67 99 12 83 89 80 91 39 86 76 85 74 39 25 90 59 10 94 32 44 3 89 30 27 79 46 96 27 32 18 21 92 69 81 40 40 34 68 78 24 87 42 69 23 41 78 22 6 90 99 89 50 30 20 1 43 3 70 95 33 46 44 9 69 48 33 60 65 16 82 67 61 32 21 79 75 75 13 87 70 33'.rstrip().split()))
  
  	result = countingSort(arr)
  
  	print(*result)