


from __future__ import annotations

import math
from itertools import permutations






def    _UpperCAmelCase	(   __lowerCamelCase       )		->bool:


 '''simple docstring'''

 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    _UpperCAmelCase	(   __lowerCamelCase = 7       )		->int:


 '''simple docstring'''
 snake_case   : Union[str, Any]	  =      ''''''.join(str(__lowerCamelCase       ) for i in range(1 ,     n + 1       )       )
 snake_case   : Any	  =      [int(''''''.join(__lowerCamelCase       )       ) for i in permutations(__lowerCamelCase ,     __lowerCamelCase       )]
 snake_case   : List[Any]	  =      [num for num in perm_list if is_prime(__lowerCamelCase       )]
 return max(__lowerCamelCase       ) if pandigitals else 0


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










from itertools import permutations






def    _UpperCAmelCase	(   )		->str:


 '''simple docstring'''
 snake_case   : Any	  =      list(map(''''''.join ,     permutations('''0123456789'''       )       )       )
 return result[999999]


if __name__ == "__main__":
  print(solution())






