






def     a_   (__A      )				->						list:



					"""simple docstring"""

					if len(__A      ) < 2:
										return collection

					def circle_sort_util(__A				,       __A				,       __A      ) -> bool:
										__a					:						Any      =					False

										if low == high:
															return swapped

										__a					:						List[str]      =					low
										__a					:						List[str]      =					high

										while left < right:
															if collection[left] > collection[right]:
																				__a      ,			__a					:						List[Any]      =					(
																				    collection[right],
																				    collection[left],
																				)
																				__a					:						str      =					True

															left += 1
															right -= 1

										if left == right and collection[left] > collection[right + 1]:
															__a      ,			__a					:						int      =					(
															    collection[right + 1],
															    collection[left],
															)

															__a					:						Any      =					True

										__a					:						str      =					low + int((high - low) / 2      )
										__a					:						str      =					circle_sort_util(__A				,       __A				,       __A      )
										__a					:						List[Any]      =					circle_sort_util(__A				,       mid + 1				,       __A      )

										return swapped or left_swap or right_swap

					__a					:						str      =					True

					while is_not_sorted is True:
										__a					:						Tuple      =					circle_sort_util(__A				,       0				,       len(__A      ) - 1      )

					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(circle_sort(unsorted))













from __future__ import annotations







def     a_   (__A      )				->						int:



					"""simple docstring"""
					__a					:						List[Any]      =					len(__A      ) // 2

					# choose the middle 3 elements
					__a					:						Any      =					lst[m - 1 : m + 2]

					# if middle element is peak
					if three[1] > three[0] and three[1] > three[2]:
										return three[1]

					# if increasing, recurse on right
					elif three[0] < three[2]:
										if len(lst[:m]      ) == 2:
															m -= 1
										return peak(lst[m:]      )

					# decreasing
					else:
										if len(lst[:m]      ) == 2:
															m += 1
										return peak(lst[:m]      )


if __name__ == "__main__":
			import doctest

			doctest.testmod()





