



'''simple docstring'''





def 							lowerCamelCase	(					_snake_case	:    int							):





    '''simple docstring'''


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

    lowercase__									=    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()









'''simple docstring'''





def 							lowerCamelCase	(					_snake_case	:    list							):





    '''simple docstring'''


    if not isinstance(_snake_case  ,_snake_case							):
        raise ValueError("Input series is not valid, valid series - [2, 4, 6]"							)
    if len(_snake_case							) == 0:
        raise ValueError("Input list must be a non empty list"							)
    if len(_snake_case							) == 1:
        return True
    lowercase__									=    series[1] - series[0]
    for index in range(len(_snake_case							) - 1							):
        if series[index + 1] - series[index] != common_diff:
            return False
    return True




def 							lowerCamelCase	(					_snake_case	:    list							):





    '''simple docstring'''


    if not isinstance(_snake_case  ,_snake_case							):
        raise ValueError("Input series is not valid, valid series - [2, 4, 6]"							)
    if len(_snake_case							) == 0:
        raise ValueError("Input list must be a non empty list"							)
    lowercase__									=    0
    for val in series:
        answer += val
    return answer / len(_snake_case							)


if __name__ == "__main__":
 import doctest

 doctest.testmod()




