
'''simple docstring'''
import random




def       _UpperCamelCase	(					SCREAMING_SNAKE_CASE__ )     ->       Optional[int]:


		'''simple docstring'''


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

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


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




'''simple docstring'''
def       _UpperCamelCase	(					)     ->       int:


		'''simple docstring'''


		for a in range(300 ):
				for b in range(a + 1   ,					400 ):
						for c in range(b + 1   ,					500 ):
								if (a + b + c) == 1000 and (a**2) + (b**2) == (c**2):
										return a * b * c

		return -1




def       _UpperCamelCase	(					)     ->       int:


		'''simple docstring'''


		for a in range(300 ):
				for b in range(400 ):
						snake_case     :					Dict     =	1000 - a - b
						if a < b < c and (a**2) + (b**2) == (c**2):
								return a * b * c

		return -1




def       _UpperCamelCase	(					)     ->       None:


		'''simple docstring'''


		import timeit

		print(
		    timeit.timeit('''solution()'''   ,					setup='''from __main__ import solution'''   ,					number=1000 ) )
		print(
		    timeit.timeit(
		        '''solution_fast()'''   ,					setup='''from __main__ import solution_fast'''   ,					number=1000 ) )


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


