from __future__ import annotations

import math
from itertools import permutations
def 		snake_case__  (		lowercase				):




    if 1 < number < 4:
        # 2 and 3 are primes
        return True
    elif number < 2 or number % 2 == 0 or number % 3 == 0:
        # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
        return False

    # All primes number are in format of 6k +/- 1
    for i in range(5       ,							int(math.sqrt(lowerCamelCase__				) + 1				)       ,							6				):
        if number % i == 0 or number % (i + 2) == 0:
            return False
    return True
def 		snake_case__  (		lowercase = 7				):
    lowerCAmelCase_:       Dict         =  "".join(str(lowerCamelCase__				) for i in range(1       ,							n + 1				)				)
    lowerCAmelCase_:       int         =  [int("".join(lowerCamelCase__				)				) for i in permutations(lowerCamelCase__       ,							lowerCamelCase__				)]
    lowerCAmelCase_:       Optional[int]         =  [num for num in perm_list if is_prime(lowerCamelCase__				)]
    return max(lowerCamelCase__				) if pandigitals else 0


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