




def        __SCREAMING_SNAKE_CASE (	lowercase_ = 99_80_01   )							->						int:

    """simple docstring"""


    for number in range(n - 1       ,  99_99       ,  -1   ):
        __UpperCamelCase			=    str(lowercase_   )

        # checks whether 'str_number' is a palindrome.
        if str_number == str_number[::-1]:
            __UpperCamelCase			=    9_99

            # 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() = }""")








"""simple docstring"""


def        _lowerCamelCase(__UpperCamelCase = 20			)							->					int:

	try:
		_lowerCAmelCase								=int(__UpperCamelCase			)
	except (TypeError, ValueError):
		raise TypeError("""Parameter n must be int or castable to int."""			)
	if n <= 0:
		raise ValueError("""Parameter n must be greater than or equal to one."""			)
	_lowerCAmelCase								=0
	while 1:
		i += n * (n - 1)
		_lowerCAmelCase								=0
		for j in range(2       ,					__UpperCamelCase			):
			if i % j != 0:
				_lowerCAmelCase								=1
				break
		if nfound == 0:
			if i == 0:
				_lowerCAmelCase								=1
			return i
	return None


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



