
def      __lowercase       (			a__       )    ->			list:
							__SCREAMING_SNAKE_CASE									= len(a__       )
							for i in range(1							,       a__       ):
														__SCREAMING_SNAKE_CASE									= collection[i]
														__SCREAMING_SNAKE_CASE									= 0
														__SCREAMING_SNAKE_CASE									= i - 1

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


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











from __future__ import annotations

from collections.abc import Generator






def      __lowercase       (			)    ->			Generator[int, None, None]:
							__SCREAMING_SNAKE_CASE									= {}
							__SCREAMING_SNAKE_CASE									= 2
							while True:
														__SCREAMING_SNAKE_CASE									= factor_map.pop(a__							,       a__       )
														if factor:
																					__SCREAMING_SNAKE_CASE									= factor + prime
																					while x in factor_map:
																												x += factor
																					__SCREAMING_SNAKE_CASE									= factor
														else:
																					__SCREAMING_SNAKE_CASE									= prime
																					yield prime
														prime += 1






def      __lowercase       (			a__ = 1E10       )    ->			int:
							__SCREAMING_SNAKE_CASE									= sieve()

							__SCREAMING_SNAKE_CASE									= 1
							while True:
														__SCREAMING_SNAKE_CASE									= next(a__       )
														if (2 * prime * n) > limit:
																					return n
														# Ignore the next prime as the reminder will be 2.
														next(a__       )
														n += 2


if __name__ == "__main__":
			print(solution())






