


'''simple docstring'''






def 				UpperCamelCase_			(    A__					:   Any = 1_00_00_00					):
  '''simple docstring'''





  lowerCAmelCase_			:      List[str]			=   limit + 1
  lowerCAmelCase_			:      Optional[Any]			=   [0] * limit
  for first_term in range(1							,    lowerCAmelCase__					):
    for n in range(lowerCAmelCase__							,    lowerCAmelCase__							,    lowerCAmelCase__					):
      lowerCAmelCase_			:      Union[str, Any]			=   first_term + n / first_term
      if common_difference % 4:  # d must be divisble by 4
        continue
      else:
        common_difference /= 4
        if (
            first_term > common_difference
            and first_term < 4 * common_difference
        ):  # since x,y,z are positive integers
          frequency[n] += 1  # so z>0 and a>d ,also 4d<a

  lowerCAmelCase_			:      Optional[Any]			=   sum(1 for x in frequency[1:limit] if x == 10					)

  return count


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







'''simple docstring'''
def 					a__       (					lowerCAmelCase__						)    ->	int:
    if a < 0:
        raise ValueError('''Input value must be a positive integer'''						)
    elif isinstance(lowerCAmelCase__  ,					lowerCAmelCase__						):
        raise TypeError('''Input value must be a \'int\' type'''						)
    return bin(lowerCAmelCase__						).count('''1'''						)


if __name__ == "__main__":
  import doctest

  doctest.testmod()
