





from math import factorial






def  SCREAMING_SNAKE_CASE__							(				UpperCamelCase__:							List[str]    ,      UpperCamelCase__:							Dict			):
		return factorial(UpperCamelCase__			) / (factorial(UpperCamelCase__			) * factorial(n - r			))






def  SCREAMING_SNAKE_CASE__							(				):
		SCREAMING_SNAKE_CASE__								=					0

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


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







from __future__ import annotations

from collections.abc import Generator

def    lowerCAmelCase__		(			_a				:	int			):
		if not isinstance(_a     ,					_a			) or n < 1:
				raise Exception("Sequence only defined for positive integers"			)

		yield n
		while n != 1:
				if n % 2 == 0:
						n //= 2
				else:
						snake_case_ :							List[str]         =				3 * n + 1
				yield n

def    lowerCAmelCase__		(			):
		snake_case_ :							Optional[int]         =				43
		snake_case_ :							Union[str, Any]         =				tuple(collatz_sequence(_a			)			)
		print(_a			)
		print(F'''Collatz sequence from {n} took {len(_a			)} steps.'''			)


if __name__ == "__main__":
							main()
