






from math import factorial



def      _SCREAMING_SNAKE_CASE  (	__lowercase				:     int     ,			__lowercase				:     Dict      )  -> List[Any]:





				"""simple docstring"""

				return factorial(lowercase__      ) / (factorial(lowercase__      ) * factorial(n - r      ))



def      _SCREAMING_SNAKE_CASE  (	)  -> int:





				"""simple docstring"""

				__A             =		0

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


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












def      _SCREAMING_SNAKE_CASE  (	__lowercase				:     int     ,			__lowercase				:     int      )  -> int:





    """simple docstring"""

    __A             =		1.0
    for i in range(1     ,			r + 1      ):
        ret *= (n + 1 - i) / i
    return round(__lowercase      )



def      _SCREAMING_SNAKE_CASE  (	__lowercase				:     int      )  -> int:





    """simple docstring"""

    return choose(8 + n     ,			__lowercase      ) + choose(9 + n     ,			__lowercase      ) - 1_0



def      _SCREAMING_SNAKE_CASE  (	__lowercase				:     int      )  -> int:





    """simple docstring"""

    return sum(non_bouncy_exact(__lowercase      ) for i in range(1     ,			n + 1      )      )



def      _SCREAMING_SNAKE_CASE  (	__lowercase				:     int = 1_0_0      )  -> int:





    """simple docstring"""

    return non_bouncy_upto(__lowercase      )


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




