
def 		lowercase_    (     A__	)							->							int:
    """simple docstring"""

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

    snake_case				  =      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_    (     A__ = 1000	)							->							int:
    """simple docstring"""

    snake_case				  =      -1
    snake_case				  =      0
    for a in range(1				,	n // 3	):
        # Solving the two equations a**2+b**2=c**2 and a+b+c=N eliminating c
        snake_case				  =      (n * n - 2 * a * n) // (2 * n - 2 * a)
        snake_case				  =      n - a - b
        if c * c == (a * a + b * b):
            snake_case				  =      a * b * c
            if candidate >= product:
                snake_case				  =      candidate
    return product


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

