

def        __UpperCamelCase     (      _A					:							int		)				->list:



							"""simple docstring"""
							lowerCamelCase_								=[True for i in range(n + 1		)]
							lowerCamelCase_								=[i - 1 for i in range(n + 1		)]
							lowerCamelCase_								=[]
							for i in range(2      ,  n + 1		):
														if is_prime[i]:
																					primes.append(_A		)
														for j in range(0      ,  len(_A		)		):
																					if i * primes[j] >= n:
																												break
																					lowerCamelCase_								=False

																					if i % primes[j] == 0:
																												lowerCamelCase_								=totients[i] * primes[j]
																												break

																					lowerCamelCase_								=totients[i] * (primes[j] - 1)

							return totients


if __name__ == "__main__":
	import doctest

	doctest.testmod()



from math import factorial




def        __UpperCamelCase     (      _A					:							Union[str, Any]      ,  _A					:							Tuple		)				->Any:



							"""simple docstring"""
							return factorial(_A		) / (factorial(_A		) * factorial(n - r		))




def        __UpperCamelCase     (      )				->Any:



							"""simple docstring"""
							lowerCamelCase_								=0

							for i in range(1      ,  101		):
														for j in range(1      ,  i + 1		):
																					if combinations(_A      ,  _A		) > 1E6:
																												total += 1
							return total


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