





def 							SCREAMING_SNAKE_CASE__  (			__a = 10_00      ):
	snake_case_  ,snake_case_						:	List[str]      =		1, 1
	snake_case_						:	Optional[Any]      =		[]
	for i in range(1      ,       n + 1      ):
		snake_case_						:	List[Any]      =		prev_numerator + 2 * prev_denominator
		snake_case_						:	Union[str, Any]      =		prev_numerator + prev_denominator
		if len(str(lowerCAmelCase__      )      ) > len(str(lowerCAmelCase__      )      ):
			result.append(lowerCAmelCase__      )
		snake_case_						:	Optional[int]      =		numerator
		snake_case_						:	List[str]      =		denominator

	return len(lowerCAmelCase__      )


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


"""simple docstring"""






def 			UpperCAmelCase__       (				lowerCAmelCase__     :str					,		lowerCAmelCase__     :Optional[Any]		) ->    int:
      '''simple docstring'''


      lowercase														=	[0 for i in range(r + 1		)]
      # nc0 = 1
      lowercase														=	1
      for i in range(1					,		n + 1		):
            # to compute current row from previous row.
            lowercase														=	min(lowerCAmelCase__					,		lowerCAmelCase__		)
            while j > 0:
                  c[j] += c[j - 1]
                  j -= 1
      return c[r]






print(binomial_coefficient(n=1_0, r=5))



