

def        __UpperCamelCase     (      _A					:							Any      ,  _A					:							str		)				->Any:



							"""simple docstring"""
							lowerCamelCase_								=1
							while b > 0:
														if b & 1:
																					res *= a

														a *= a
														b >>= 1

							return res




def        __UpperCamelCase     (      _A					:							Dict      ,  _A					:							Tuple      ,  _A					:							Tuple		)				->List[Any]:



							"""simple docstring"""
							lowerCamelCase_								=1
							while b > 0:
														if b & 1:
																					lowerCamelCase_								=((res % c) * (a % c)) % c

														a *= a
														b >>= 1

							return res



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())
