


"""simple docstring"""







import math
from collections.abc import Iterator
from itertools import takewhile




def        UpperCAmelCase__	(lowerCAmelCase_       ):




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




def        UpperCAmelCase__	():




					'''simple docstring'''


					__SCREAMING_SNAKE_CASE						       =    2
					while True:
										if is_prime(a__       ):
															yield num
										num += 1




def        UpperCAmelCase__	(lowerCAmelCase_ = 200_0000       ):




					'''simple docstring'''


					return sum(takewhile(lambda lowerCAmelCase_       : x < n  ,						prime_generator()       )       )


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




"""simple docstring"""







def        UpperCAmelCase__	(lowerCAmelCase_  ,						lowerCAmelCase_       ):




					'''simple docstring'''


					__SCREAMING_SNAKE_CASE						       =    [0 for i in range(r + 1       )]
					# nc0 = 1
					__SCREAMING_SNAKE_CASE						       =    1
					for i in range(1  ,						n + 1       ):
										# to compute current row from previous row.
										__SCREAMING_SNAKE_CASE						       =    min(lowerCAmelCase_  ,						lowerCAmelCase_       )
										while j > 0:
															c[j] += c[j - 1]
															j -= 1
					return c[r]



print(binomial_coefficient(n=1_0, r=5))
