






def      UpperCAmelCase						( lowerCAmelCase__ = 99_8001	):


		'''simple docstring'''

		__A    =							0
		for i in range(999					,     99					,     -1	):  # 3 digit numbers range from 999 down to 100
				for j in range(999					,     99					,     -1	):
						__A    =							str(i * j	)
						if product_string == product_string[::-1] and i * j < n:
								__A    =							max(lowerCAmelCase__					,     i * j	)
		return answer


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



'''simple docstring'''





def 							snake_case				(		UpperCAmelCase						)->      list:







      """simple docstring"""
      __A													=      1.3
      __A													=      len(UpperCAmelCase						)
      __A													=      False

      while not completed:
            # Update the gap value for a next comb
            __A													=      int(gap / shrink_factor						)
            if gap <= 1:
                  __A													=      True

            __A													=      0
            while index + gap < len(UpperCAmelCase						):
                  if data[index] > data[index + gap]:
                        # Swap values
                        __A						,   __A													=      data[index + gap], data[index]
                        __A													=      False
                  index += 1

      return data


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 a__		: Optional[Any]  							=							input("Enter numbers separated by a comma:\n").strip()
 a__		: Union[str, Any]  							=							[int(item) for item in user_input.split(",")]
 print(comb_sort(unsorted))






