





from __future__ import annotations

import math
from itertools import permutations



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



def   __lowercase  ( _SCREAMING_SNAKE_CASE = 7      )					->  int:


      '''simple docstring'''


      SCREAMING_SNAKE_CASE						=		''.join(str(_UpperCAmelCase      ) for i in range(1					,		n + 1      )      )
      SCREAMING_SNAKE_CASE						=		[int("""""".join(_UpperCAmelCase      )      ) for i in permutations(_UpperCAmelCase					,		_UpperCAmelCase      )]
      SCREAMING_SNAKE_CASE						=		[num for num in perm_list if is_prime(_UpperCAmelCase      )]
      return max(_UpperCAmelCase      ) if pandigitals else 0


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







"""simple docstring"""




def 	lowercase__  (      )  ->      Any:






      '''simple docstring'''


      lowercase	:   Dict											= 1

      while True:
            if (
                sorted(str(_UpperCAmelCase					)					)
                == sorted(str(2 * i					)					)
                == sorted(str(3 * i					)					)
                == sorted(str(4 * i					)					)
                == sorted(str(5 * i					)					)
                == sorted(str(6 * i					)					)
            ):
                  return i

            i += 1


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