

from math import isqrt

def 						UpperCamelCase					(lowercase_: int					)     ->      bool:
	return all(number % divisor != 0 for divisor in range(2    ,      isqrt(lowercase_					) + 1					)					)

def 						UpperCamelCase					(lowercase_: int = 10**6					)     ->      int:
	A__							:    str        =		0
	A__							:    Optional[int]        =		1
	A__							:    Tuple        =		7
	while prime_candidate < max_prime:
		primes_count += is_prime(lowercase_					)

		cube_index += 1
		prime_candidate += 6 * cube_index

	return primes_count


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






from math import factorial

def 						UpperCamelCase					(lowercase_: int = 20					)     ->      int:
	A__							:    Union[str, Any]        =		2 * n  # middle entry of odd rows starting at row 3 is the solution for n = 1,
	# 2, 3,...
	A__							:    Tuple        =		n // 2

	return int(factorial(lowercase_					) / (factorial(lowercase_					) * factorial(n - k					))					)


if __name__ == "__main__":
	import sys

	if len(sys.argv) == 1:
		print(solution(20))
	else:
		try:
			A_       : List[str]         =			int(sys.argv[1])
			print(solution(n))
		except ValueError:
			print('Invalid entry - please enter a number.')



