




'''simple docstring'''



from math import factorial
def  SCREAMING_SNAKE_CASE_ (							__A				: Optional[int]       ,     __A				: Optional[int]  ) -> int:
   return factorial(lowercase_  ) / (factorial(lowercase_  ) * factorial(n - r  ))
def  SCREAMING_SNAKE_CASE_ (							) -> Any:
   _SCREAMING_SNAKE_CASE       =      0

   for i in range(1       ,     1_01  ):
      for j in range(1       ,     i + 1  ):
         if combinations(lowercase_       ,     lowercase_  ) > 1e6:
            total += 1
   return total


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







'''simple docstring'''







from __future__ import annotations

import math
from itertools import permutations






def 		_lowercase		(	lowercase_  ):



		'''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 		_lowercase		(	lowercase_ = 7  ):



		'''simple docstring'''







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


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





