


from __future__ import annotations

import math
from itertools import permutations


def 	_UpperCamelCase							(				lowercase__				):

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


def 	_UpperCamelCase							(				lowercase__ = 7				):
						__SCREAMING_SNAKE_CASE						:					Any		      =		''''''.join(str(lowercase__				) for i in range(1 ,	n + 1				)				)
						__SCREAMING_SNAKE_CASE						:					Union[str, Any]		      =		[int(''''''.join(lowercase__				)				) for i in permutations(lowercase__ ,	lowercase__				)]
						__SCREAMING_SNAKE_CASE						:					Optional[Any]		      =		[num for num in perm_list if is_prime(lowercase__				)]
						return max(lowercase__				) if pandigitals else 0


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




from __future__ import annotations


def 	_UpperCamelCase							(				lowercase__				):
						__SCREAMING_SNAKE_CASE						:					List[Any]		      =		sorted(lowercase__				)
						__SCREAMING_SNAKE_CASE						:					str		      =		len(lowercase__				)
						__SCREAMING_SNAKE_CASE						:					Union[str, Any]		      =		length >> 1
						return (
						    (sorted_list[mid_index] + sorted_list[mid_index - 1]) / 2
						    if length % 2 == 0
						    else sorted_list[mid_index]
						)


def 	_UpperCamelCase							(				):
						import doctest

						doctest.testmod()


if __name__ == "__main__":
						main()
