






from __future__ import annotations

import math
from itertools import permutations







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







def 	SCREAMING_SNAKE_CASE							(      __lowerCAmelCase = 7    )				->			int:
     UpperCamelCase__    :     List[str]        =						"".join(str(lowerCamelCase__    ) for i in range(1      ,					n + 1    )    )
     UpperCamelCase__    :     Optional[int]        =						[int("".join(lowerCamelCase__    )    ) for i in permutations(lowerCamelCase__      ,					lowerCamelCase__    )]
     UpperCamelCase__    :     List[str]        =						[num for num in perm_list if is_prime(lowerCamelCase__    )]
     return max(lowerCamelCase__    ) if pandigitals else 0


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







def 	SCREAMING_SNAKE_CASE							(      __lowerCAmelCase    )				->			str:
     return "".join(chr(ord(__lowerCAmelCase    ) + 32    ) if "A" <= char <= "Z" else char for char in word    )


if __name__ == "__main__":
 from doctest import testmod

 testmod()