


from __future__ import annotations

import math
from itertools import permutations
def 							UpperCAmelCase_   (				__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(__snake_case		) + 1		)	,		6		):
  if number % i == 0 or number % (i + 2) == 0:
   return False
 return True
def 							UpperCAmelCase_   (				__snake_case = 7		)	->     int:







 """simple docstring"""


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


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





import math
def 							UpperCAmelCase_   (				__snake_case		)	->     int:







 """simple docstring"""


 return sum(int(__snake_case		) for digit in str(__snake_case		)		)
def 							UpperCAmelCase_   (				__snake_case = 30		)	->     int:







 """simple docstring"""


 _lowercase				 =[]
 for digit in range(2	,		100		):
  for power in range(2	,		100		):
   _lowercase				 =int(math.pow(__snake_case	,		__snake_case		)		)
   if digit == digit_sum(__snake_case		):
    digit_to_powers.append(__snake_case		)

 digit_to_powers.sort()
 return digit_to_powers[n - 1]


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

