
from __future__ import annotations

import math
from itertools import permutations

def 					__lowerCAmelCase    (    a__						) ->						bool:

				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(a__						) + 1						)		,					6						):
								if number % i == 0 or number % (i + 2) == 0:
												return False
				return True

def 					__lowerCAmelCase    (    a__ = 7						) ->						int:
				__a    							=					''''''.join(str(a__						) for i in range(1		,					n + 1						)						)
				__a    							=					[int(''''''.join(a__						)						) for i in permutations(a__		,					a__						)]
				__a    							=					[num for num in perm_list if is_prime(a__						)]
				return max(a__						) if pandigitals else 0


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

def 					__lowerCAmelCase    (    a__ = 99_8001						) ->						int:
				__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(a__		,					i * j						)
				return answer


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