






from math import factorial






def        lowerCamelCase__   (					__lowerCamelCase    :  str						,	__lowerCamelCase    :  Optional[Any]	):
  return factorial(__lowerCamelCase	) / (factorial(__lowerCamelCase	) * factorial(n - r	))






def        lowerCamelCase__   (					):
  __UpperCAmelCase							:			Any     =						0

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


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










import decimal






def        lowerCamelCase__   (					):
  __UpperCAmelCase							:			str     =						0
  __UpperCAmelCase							:			Tuple     =						decimal.Context(prec=105	)
  for i in range(2						,	100	):
    __UpperCAmelCase							:			Optional[int]     =						decimal.Decimal(__lowerCamelCase	)
    __UpperCAmelCase							:			Any     =						number.sqrt(__lowerCamelCase	)
    if len(str(__lowerCamelCase	)	) > 1:
      answer += int(str(__lowerCamelCase	)[0]	)
      __UpperCAmelCase							:			Optional[Any]     =						str(__lowerCamelCase	)[2:101]
      answer += sum(int(__lowerCamelCase	) for x in sqrt_number_str	)
  return answer


if __name__ == "__main__":
       import doctest

       doctest.testmod()
       print(f"""{solution() = }""")


