from __future__ import annotations





def  _lowerCamelCase					(   a_				: list						,			a_				: int):
			# Checks if the entire collection has been sorted
			if len(a_) <= 1 or n <= 1:
						return

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





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

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

			insert_next(a_						,			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)




import math





def  _lowerCamelCase					(   a_				: int):

			if 1 < number < 4:
						# 2 and 3 are primes
						return True
			elif number < 2 or number % 2 == 0 or number % 3 == 0:
						# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
						return False

			# All primes number are in format of 6k +/- 1
			for i in range(5						,			int(math.sqrt(a_) + 1)						,			6):
						if number % i == 0 or number % (i + 2) == 0:
									return False
			return True





def  _lowerCamelCase					(   a_				: float = 0.1):
			lowerCamelCase						:Dict						  =     3
			lowerCamelCase						:List[Any]						  =     3

			while primes / (2 * j - 1) >= ratio:
						for i in range(j * j + j + 1						,			(j + 2) * (j + 2)						,			j + 1):
									primes += is_prime(a_)
						j += 2
			return j


if __name__ == "__main__":
			import doctest

			doctest.testmod()



