

from __future__ import annotations

import math
from itertools import permutations






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






def  a_	( __lowercase     :			List[Any] = 7				)				->						int:
			_snake_case						=    ''.join(str(_UpperCAmelCase				) for i in range(1 ,      n + 1				)				)
			_snake_case						=    [int(''.join(_UpperCAmelCase				)				) for i in permutations(_UpperCAmelCase ,      _UpperCAmelCase				)]
			_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() = }')

def  a_	( __lowercase     :			int				)				->						bool:
			_snake_case						=    9

			while num > 0:
						if num % 10 != digit:
									return False
						num //= 100
						digit -= 1

			return True






def  a_	( )				->						int:
			_snake_case						=    138_902_663

			while not is_square_form(num * num				):
						if num % 10 == 3:
									num -= 6  # (3 - 6) % 10 = 7
						else:
									num -= 4  # (7 - 4) % 10 = 3

			return num * 10


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