





def     _UpperCamelCase     (a__   :list       ):






							"""simple docstring"""





							UpperCamelCase__				     =			len(a__       )
							for i in range(1   ,			a__       ):
														UpperCamelCase__				     =			collection[i]
														UpperCamelCase__				     =			0
														UpperCamelCase__				     =			i - 1

														while low <= high:
																					UpperCamelCase__				     =			(low + high) // 2
																					if val < collection[mid]:
																												UpperCamelCase__				     =			mid - 1
																					else:
																												UpperCamelCase__				     =			mid + 1
														for j in range(a__   ,			a__   ,			-1       ):
																					UpperCamelCase__				     =			collection[j - 1]
														UpperCamelCase__				     =			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))











def     _UpperCamelCase     (a__   :int       ):






							"""simple docstring"""





							if divisor % 5 == 0 or divisor % 2 == 0:
														return 0
							UpperCamelCase__				     =			1
							UpperCamelCase__				     =			1
							while repunit:
														UpperCamelCase__				     =			(10 * repunit + 1) % divisor
														repunit_index += 1
							return repunit_index





def     _UpperCamelCase     (a__   :int = 100_0000       ):






							"""simple docstring"""





							UpperCamelCase__				     =			limit - 1
							if divisor % 2 == 0:
														divisor += 1
							while least_divisible_repunit(a__       ) <= limit:
														divisor += 2
							return divisor


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




