


'''simple docstring'''



from __future__ import annotations







def       _UpperCamelCase (						UpperCamelCase__	, UpperCamelCase__   ):
			# Checks if the entire collection has been sorted
			if len(UpperCamelCase__   ) <= 1 or n <= 1:
						return

			insert_next(UpperCamelCase__	, n - 1   )
			rec_insertion_sort(UpperCamelCase__	, n - 1   )







def       _UpperCamelCase (						UpperCamelCase__	, UpperCamelCase__   ):
			# Checks order between adjacent elements
			if index >= len(UpperCamelCase__   ) or collection[index - 1] <= collection[index]:
						return

			# Swaps adjacent elements since they are not in ascending order
			UpperCAmelCase__				,    UpperCAmelCase__					:   Optional[Any]       				=       (
			    collection[index],
			    collection[index - 1],
			)

			insert_next(UpperCamelCase__	, index + 1   )


if __name__ == "__main__":
		__A		=input('Enter integers separated by spaces: ')
		__A		=[int(num) for num in numbers.split()]
		rec_insertion_sort(number_list, len(number_list))
		print(number_list)



'''simple docstring'''



def       _UpperCamelCase (						UpperCamelCase__ = 1_0	, UpperCamelCase__ = 2_2   ):
			UpperCAmelCase__					:   List[str]       				=       range(1	, UpperCamelCase__   )
			UpperCAmelCase__					:   int       				=       range(1	, UpperCamelCase__   )
			return sum(
			    1 for power in powers for base in bases if len(str(base**power   )   ) == power   )


if __name__ == "__main__":
		print(f"""{solution(10, 22) = }""")