


def 		snake_case_   (				lowercase__     :    str     ):






				'''simple docstring'''






				_lowerCAmelCase  						=str(lowercase__     ).strip()
				if not bin_string:
								raise ValueError("""Empty string was passed to the function"""     )
				_lowerCAmelCase  						=bin_string[0] == """-"""
				if is_negative:
								_lowerCAmelCase  						=bin_string[1:]
				if not all(char in """01""" for char in bin_string     ):
								raise ValueError("""Non-binary value was passed to the function"""     )
				_lowerCAmelCase  						=0
				for char in bin_string:
								_lowerCAmelCase  						=2 * decimal_number + int(lowercase__     )
				return -decimal_number if is_negative else decimal_number


if __name__ == "__main__":
		from doctest import testmod

		testmod()





from __future__ import annotations

import math
from itertools import permutations

def 		snake_case_   (				lowercase__     :    int     ):






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

def 		snake_case_   (				lowercase__     :    int = 7     ):






				'''simple docstring'''






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


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

