
from math import ceil, sqrt






def   lowerCamelCase__							(							__lowerCAmelCase    :    int = 1000000							):




			"""simple docstring"""


			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   lowerCamelCase__							(							__lowerCAmelCase    :    list							):




			"""simple docstring"""


			for i in range(len(__lowerCAmelCase							) - 1       ,				0       ,				-1							):
						lowerCAmelCase_         =      False

						for j in range(__lowerCAmelCase       ,				0       ,				-1							):
									if unsorted[j] < unsorted[j - 1]:
												lowerCAmelCase_      ,    lowerCAmelCase_         =      unsorted[j - 1], unsorted[j]
												lowerCAmelCase_         =      True

						for j in range(__lowerCAmelCase							):
									if unsorted[j] > unsorted[j + 1]:
												lowerCAmelCase_      ,    lowerCAmelCase_         =      unsorted[j + 1], unsorted[j]
												lowerCAmelCase_         =      True

						if not swapped:
									break
			return unsorted


if __name__ == "__main__":
			import doctest

			doctest.testmod()
			_A  =	input("Enter numbers separated by a comma:\n").strip()
			_A  =	[int(item) for item in user_input.split(",")]
			print(f"""{cocktail_shaker_sort(unsorted) = }""")



