
from math import factorial



def       _lowercase					(      __SCREAMING_SNAKE_CASE				,    __SCREAMING_SNAKE_CASE )	->     int:
			return factorial(__SCREAMING_SNAKE_CASE ) / (factorial(__SCREAMING_SNAKE_CASE ) * factorial(n - r ))



def       _lowercase					(      )	->     List[str]:
			UpperCamelCase__    :		Tuple     =				0

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


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





from __future__ import annotations

import re



def       _lowercase					(      __SCREAMING_SNAKE_CASE )	->     list[str]:

			def alphanum_key(__SCREAMING_SNAKE_CASE ):
						return [int(__SCREAMING_SNAKE_CASE ) if s.isdigit() else s.lower() for s in re.split('([0-9]+)'				,    __SCREAMING_SNAKE_CASE )]

			return sorted(__SCREAMING_SNAKE_CASE				,    key=__SCREAMING_SNAKE_CASE )


if __name__ == "__main__":
							import doctest

							doctest.testmod()



