

'''simple docstring'''





import os
from math import logaa






def 				_lowerCAmelCase			(   __magic_name__						:     Dict = "base_exp.txt"						)				->  int:
						lowercase :							List[str]    		=0
						lowercase :							Optional[int]    		=0
						for i, line in enumerate(open(os.path.join(os.path.dirname(__magic_name__						)   , __magic_name__						)						)						):
												lowercase		,	lowercase :							List[str]    		=list(map(__magic_name__   , line.split(''','''						)						)						)
												if x * logaa(__magic_name__						) > largest:
																		lowercase :							Optional[Any]    		=x * logaa(__magic_name__						)
																		lowercase :							Optional[Any]    		=i + 1
						return result


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












def 				_UpperCAmelCase			(    A     ):




   '''simple docstring'''

   for i in range(len(A     ) - 1				,							0				,							-1     ):
      UpperCAmelCase__						=False

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

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

      if not swapped:
         break
   return unsorted


if __name__ == "__main__":
    import doctest

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



