






from math import ceil, sqrt







def 			_a   (		SCREAMING_SNAKE_CASE_							:       int = 1_00_00_00  ):
					__lowerCAmelCase            = 0

					for outer_width in range(3   ,   (limit // 4) + 2  ):
										if outer_width**2 > limit:
															__lowerCAmelCase            = max(ceil(sqrt(outer_width**2 - limit  )  )   ,   1  )
										else:
															__lowerCAmelCase            = 1
										if (outer_width - hole_width_lower_bound) % 2:
															hole_width_lower_bound += 1

										answer += (outer_width - hole_width_lower_bound - 2) // 2 + 1

					return answer


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










def 			_a   (		SCREAMING_SNAKE_CASE_							:       list[int]  ):
					__lowerCAmelCase            = len(SCREAMING_SNAKE_CASE_  )
					for i in range(SCREAMING_SNAKE_CASE_  ):
										for j in range(i + 1   ,   SCREAMING_SNAKE_CASE_  ):
															if numbers[j] < numbers[i]:
																				__lowerCAmelCase     ,							__lowerCAmelCase            = numbers[j], numbers[i]
					return numbers


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




