




def 			lowerCamelCase_		(       UpperCamelCase__				:      Any ,     UpperCamelCase__				:      Optional[int]      )     ->       Optional[Any]:





				"""simple docstring"""


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


print(binomial_coefficient(n=10, r=5))








from math import sqrt







def 			lowerCamelCase_		(       UpperCamelCase__				:      int      )     ->       bool:





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







def 			lowerCamelCase_		(       UpperCamelCase__				:      int = 1_0001      )     ->       int:





				"""simple docstring"""


				__lowerCamelCase		       =    0
				__lowerCamelCase		       =    1
				while count != nth and number < 3:
								number += 1
								if is_prime(UpperCamelCase__      ):
												count += 1
				while count != nth:
								number += 2
								if is_prime(UpperCamelCase__      ):
												count += 1
				return number


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


