def 		snake_case__  (		lowercase = 20				):

    try:
        lowerCAmelCase_:       Tuple         =  int(a_				)
    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_:       Any         =  0
    while 1:
        i += n * (n - 1)
        lowerCAmelCase_:       List[Any]         =  0
        for j in range(2       ,							a_				):
            if i % j != 0:
                lowerCAmelCase_:       Union[str, Any]         =  1
                break
        if nfound == 0:
            if i == 0:
                lowerCAmelCase_:       List[str]         =  1
            return i
    return None


if __name__ == "__main__":
 print(f'''{solution() = }''')
def 		snake_case__  (		lowercase = 998001				):

   # fetches the next number
   for number in range(n - 1       ,							9999       ,							-1				):
      lowerCAmelCase_:       str         =  str(lowercase				)

      # checks whether 'str_number' is a palindrome.
      if str_number == str_number[::-1]:
         lowerCAmelCase_:       List[str]         =  999

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