code: from __future__ import annotations
  
  import math
  from itertools import permutations
  
  
  def 					__lowerCAmelCase			(  _A					):
  
  
  
  							"""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(_A					) + 1					) ,6					):
  														if number % i == 0 or number % (i + 2) == 0:
  																					return False
  							return True
  
  
  def 					__lowerCAmelCase			(  _A = 7					):
  
  
  
  							"""simple docstring"""
  
  
  							_lowercase				=	"""""".join(str(_A					) for i in range(1 ,n + 1					)					)
  							_lowercase				=	[int("""""".join(_A					)					) for i in permutations(_A ,_A					)]
  							_lowercase				=	[num for num in perm_list if is_prime(_A					)]
  							return max(_A					) if pandigitals else 0
  
  
  if __name__ == "__main__":
  				print(F'''{solution() = }''')
  
  
  
style_context: def 					__lowerCAmelCase			(  _A					):
  
  
  
  							"""simple docstring"""
  
  
  							if len(_A					) <= 1:
  														return data
  							else:
  														return [
  														    *quick_sort([e for e in data[1:] if e <= data[0]]					),
  														    data[0],
  														    *quick_sort([e for e in data[1:] if e > data[0]]					),
  														]
  
  
  if __name__ == "__main__":
  				import doctest
  
  				doctest.testmod()
  
  
  