


def 		lowercase_(  SCREAMING_SNAKE_CASE_	):


  '''simple docstring'''

  if not isinstance(SCREAMING_SNAKE_CASE_      ,						SCREAMING_SNAKE_CASE_	) or number < 0:
    raise ValueError("Input must be a non-negative integer"	)

  lowerCamelCase :					Dict    =				0
  while number:
    # This way we arrive at next set bit (next 1) instead of looping
    # through each bit and checking for 1s hence the
    # loop won't run 32 times it will only run the number of `1` times
    number &= number - 1
    count += 1
  return count


if __name__ == "__main__":
   import doctest

   doctest.testmod()







def 		lowercase_(  SCREAMING_SNAKE_CASE_	):


  '''simple docstring'''

  if divisor % 5 == 0 or divisor % 2 == 0:
    return 0
  lowerCamelCase :					List[Any]    =				1
  lowerCamelCase :					Union[str, Any]    =				1
  while repunit:
    lowerCamelCase :					Union[str, Any]    =				(10 * repunit + 1) % divisor
    repunit_index += 1
  return repunit_index






def 		lowercase_(  SCREAMING_SNAKE_CASE_ = 1000000	):


  '''simple docstring'''

  lowerCamelCase :					List[str]    =				limit - 1
  if divisor % 2 == 0:
    divisor += 1
  while least_divisible_repunit(SCREAMING_SNAKE_CASE_	) <= limit:
    divisor += 2
  return divisor


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



