
'''simple docstring'''





def 							snake_case				(		UpperCAmelCase = 9_9_8_0_0_1						)->      int:







      """simple docstring"""
      __A													=      0
      for i in range(9_9_9   ,	9_9   ,	-1						):  # 3 digit numbers range from 999 down to 100
            for j in range(9_9_9   ,	9_9   ,	-1						):
                  __A													=      str(i * j						)
                  if product_string == product_string[::-1] and i * j < n:
                        __A													=      max(UpperCAmelCase   ,	i * j						)
      return answer


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








'''simple docstring'''





def 							snake_case				(		UpperCAmelCase						)->      int:







      """simple docstring"""
      if not isinstance(UpperCAmelCase   ,	UpperCAmelCase						):
            raise ValueError('double_factorial() only accepts integral values'						)
      if num < 0:
            raise ValueError('double_factorial() not defined for negative values'						)
      __A													=      1
      for i in range(UpperCAmelCase   ,	0   ,	-2						):
            value *= i
      return value


if __name__ == "__main__":
 import doctest

 doctest.testmod()






