






import random



def      UpperCAmelCase						( lowerCAmelCase__	):


		'''simple docstring'''

		def is_sorted(lowerCAmelCase__	):
				for i in range(len(lowerCAmelCase__	) - 1	):
						if collection[i] > collection[i + 1]:
								return False
				return True

		while not is_sorted(lowerCAmelCase__	):
				random.shuffle(lowerCAmelCase__	)
		return collection


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


def 					UpperCamelCase__		(							A__     ,					A__       )  ->   Any:
				if len(str(A__       )       ) == 1 or len(str(A__       )       ) == 1:
								return a * b

				snake_case__   :      Union[str, Any]   				= max(len(str(A__       )       )     ,					len(str(A__       )       )       )
				snake_case__   :      str   				= ma // 2

				snake_case__				,    snake_case__   :      Tuple   				= divmod(A__     ,					10**ma       )
				snake_case__				,    snake_case__   :      str   				= divmod(A__     ,					10**ma       )

				snake_case__   :      Optional[int]   				= karatsuba(A__     ,					A__       )
				snake_case__   :      List[Any]   				= karatsuba((aa + aa)     ,					(ba + ba)       )
				snake_case__   :      Tuple   				= karatsuba(A__     ,					A__       )

				return (z * 10 ** (2 * ma)) + ((y - z - x) * 10 ** (ma)) + (x)
def 					UpperCamelCase__		(							)  ->   Optional[int]:
				print(karatsuba(1_5463     ,					2_3489       )       )


if __name__ == "__main__":
				main()


