




def      _a				(						SCREAMING_SNAKE_CASE_							:    List[Any]					):
					__lowerCAmelCase           =	len(SCREAMING_SNAKE_CASE_					)
					for i in range(1				,				SCREAMING_SNAKE_CASE_					):
										__lowerCAmelCase           =	collection[i]
										__lowerCAmelCase           =	0
										__lowerCAmelCase           =	i - 1

										while low <= high:
															__lowerCAmelCase           =	(low + high) // 2
															if val < collection[mid]:
																				__lowerCAmelCase           =	mid - 1
															else:
																				__lowerCAmelCase           =	mid + 1
										for j in range(SCREAMING_SNAKE_CASE_				,				SCREAMING_SNAKE_CASE_				,				-1					):
															__lowerCAmelCase           =	collection[j - 1]
										__lowerCAmelCase           =	val
					return collection


if __name__ == "__main__":
					UpperCamelCase__         =      input("""Enter numbers separated by a comma:\n""").strip()
					UpperCamelCase__         =      [int(item) for item in user_input.split(""",""")]
					print(binary_insertion_sort(unsorted))












import math







def      _a				(						SCREAMING_SNAKE_CASE_							:    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(SCREAMING_SNAKE_CASE_					) + 1					)				,				6					):
										if number % i == 0 or number % (i + 2) == 0:
															return False
					return True







def      _a				(						SCREAMING_SNAKE_CASE_							:    int = 1_00_01					):

					try:
										__lowerCAmelCase           =	int(SCREAMING_SNAKE_CASE_					)
					except (TypeError, ValueError):
										raise TypeError("Parameter nth must be int or castable to int."					) from None
					if nth <= 0:
										raise ValueError("Parameter nth must be greater than or equal to one."					)
					__lowerCAmelCase           =	[]
					__lowerCAmelCase           =	2
					while len(SCREAMING_SNAKE_CASE_					) < nth:
										if is_prime(SCREAMING_SNAKE_CASE_					):
															primes.append(SCREAMING_SNAKE_CASE_					)
															num += 1
										else:
															num += 1
					return primes[len(SCREAMING_SNAKE_CASE_					) - 1]


if __name__ == "__main__":
					print(f'''{solution() = }''')




