



'''simple docstring'''







def  SCREAMING_SNAKE_CASE__ (				SCREAMING_SNAKE_CASE = 99_8001     ):
		SCREAMING_SNAKE_CASE_						:Any										=      0
		for i in range(999 ,		99 ,		-1     ):  # 3 digit numbers range from 999 down to 100
				for j in range(999 ,		99 ,		-1     ):
						SCREAMING_SNAKE_CASE_						:Tuple										=      str(i * j     )
						if product_string == product_string[::-1] and i * j < n:
								SCREAMING_SNAKE_CASE_						:List[Any]										=      max(SCREAMING_SNAKE_CASE ,		i * j     )
		return answer


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





"""simple docstring"""






def 	snake_case__  (						__lowerCamelCase							:       Union[str, Any]      ):
			"""simple docstring"""
			lowerCamelCase__						:						Dict						      =len(__lowerCamelCase      )
			for i in range(length - 1      ):
						lowerCamelCase__						:						Any						      =False
						for j in range(length - 1 - i      ):
									if collection[j] > collection[j + 1]:
												lowerCamelCase__						:						List[str]						      =True
												lowerCamelCase__      ,  lowerCamelCase__						:						List[str]						      =collection[j + 1], collection[j]
						if not swapped:
									break  # Stop iteration if the collection is sorted.
			return collection


if __name__ == "__main__":
		import doctest
		import time

		doctest.testmod()

		_lowercase					:					str 		=		input("Enter numbers separated by a comma:").strip()
		_lowercase					:					Dict 		=		[int(item) for item in user_input.split(",")]
		_lowercase					:					Optional[Any] 		=		time.process_time()
		print(*bubble_sort(unsorted), sep=",")
		print(f'Processing time: {(time.process_time() - start)%1E9 + 7}')




