

"""simple docstring"""




def  __lowerCamelCase     (			UpperCamelCase__				):







							'''simple docstring'''






							stooge(A__       ,							0       ,							len(A__				) - 1				)
							return arr





def  __lowerCamelCase     (			UpperCamelCase__       ,							UpperCamelCase__       ,							UpperCamelCase__				):







							'''simple docstring'''






							if i >= h:
														return

							# If first element is smaller than the last then swap them
							if arr[i] > arr[h]:
														snake_case_    ,   snake_case_          =   arr[h], arr[i]

							# If there are more than 2 elements in the array
							if h - i + 1 > 2:
														snake_case_          =   (int)((h - i + 1) / 3				)

														# Recursively sort first 2/3 elements
														stooge(A__       ,							A__       ,							(h - t)				)

														# Recursively sort last 2/3 elements
														stooge(A__       ,							i + t       ,							(A__)				)

														# Recursively sort first 2/3 elements
														stooge(A__       ,							A__       ,							(h - t)				)


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







def  __lowerCamelCase     (			UpperCamelCase__				):







							'''simple docstring'''






							snake_case_          =   len(UpperCamelCase__				)
							for _ in range(UpperCamelCase__				):
														for i in range(_ % 2       ,							arr_size - 1       ,							2				):
																					if arr[i + 1] < arr[i]:
																												snake_case_    ,   snake_case_          =   arr[i + 1], arr[i]

							return arr


if __name__ == "__main__":
					_UpperCAmelCase		:       Dict						    =	list(range(10, 0, -1))
					print(F'''Original: {arr}. Sorted: {odd_even_transposition(arr)}''')




