






import random



def        _lowerCamelCase(      lowerCAmelCase__					:		List[str]   ):





				'''simple docstring'''







				def is_sorted(lowerCAmelCase__					:		Dict   ):
								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__":
				A										=      input('Enter numbers separated by a comma:\n').strip()
				A										=      [int(item) for item in user_input.split(',')]
				print(bogo_sort(unsorted))







def        _lowerCamelCase(      lowerCAmelCase__					:		int = 99_8001   ):





				'''simple docstring'''







				for number in range(n - 1     ,     9999     ,     -1   ):
								SCREAMING_SNAKE_CASE_ :						int    				= str(lowerCAmelCase__   )

								# checks whether 'str_number' is a palindrome.
								if str_number == str_number[::-1]:
												SCREAMING_SNAKE_CASE_ :						str    				= 999

												# if 'number' is a product of two 3-digit numbers
												# then number is the answer otherwise fetch next number.
												while divisor != 99:
																if (number % divisor == 0) and (len(str(number // divisor   )   ) == 3.0):
																				return number
																divisor -= 1
				raise ValueError('That number is larger than our acceptable range.'   )


if __name__ == "__main__":
				print(f"""{solution() = }""")