




'''simple docstring'''
import os
from math import logaa





def 			lowerCamelCase(							SCREAMING_SNAKE_CASE_ = "base_exp.txt"     )		->		int:
			A_									= 0
			A_									= 0
			for i, line in enumerate(open(os.path.join(os.path.dirname(a__     )       ,a__     )     )     ):
						A_		, A_									= list(map(a__       ,line.split(','     )     )     )
						if x * logaa(a__     ) > largest:
									A_									= x * logaa(a__     )
									A_									= i + 1
			return result


if __name__ == "__main__":
							print(solution())








def 			lowerCAmelCase__					(     a__:						list			)    ->						list:


							'''simple docstring'''





							if len(a__			) < 2:
														return collection

							def circle_sort_util(a__:						list     ,    a__:						int     ,    a__:						int			) -> bool:
														_UpperCAmelCase											=     False

														if low == high:
																					return swapped

														_UpperCAmelCase											=     low
														_UpperCAmelCase											=     high

														while left < right:
																					if collection[left] > collection[right]:
																												_UpperCAmelCase						,			_UpperCAmelCase											=     (
																												    collection[right],
																												    collection[left],
																												)
																												_UpperCAmelCase											=     True

																					left += 1
																					right -= 1

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

																					_UpperCAmelCase											=     True

														_UpperCAmelCase											=     low + int((high - low) / 2			)
														_UpperCAmelCase											=     circle_sort_util(a__     ,    a__     ,    a__			)
														_UpperCAmelCase											=     circle_sort_util(a__     ,    mid + 1     ,    a__			)

														return swapped or left_swap or right_swap

							_UpperCAmelCase											=     True

							while is_not_sorted is True:
														_UpperCAmelCase											=     circle_sort_util(a__     ,    0     ,    len(a__			) - 1			)

							return collection


if __name__ == "__main__":
		lowerCAmelCase__    :Tuple       =				input('''Enter numbers separated by a comma:\n''').strip()
		lowerCAmelCase__    :List[str]       =				[int(item) for item in user_input.split(''',''')]
		print(circle_sort(unsorted))
