




def      A      (      _SCREAMING_SNAKE_CASE    )	-> int:
       if not isinstance(_SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    ) or number < 0:
              raise ValueError("Input must be a non-negative integer"    )

       lowerCamelCase   :      str			 =					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      A      (      _SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )	-> list:
       lowerCamelCase   :      Dict			 =					len(_SCREAMING_SNAKE_CASE    )
       lowerCamelCase   :      Union[str, Any]			 =					[]
       for i in range(len(_SCREAMING_SNAKE_CASE    ) - pat_len + 1    ):
              lowerCamelCase   :      Dict			 =					True
              for j in range(_SCREAMING_SNAKE_CASE    ):
                     if s[i + j] != pattern[j]:
                            lowerCamelCase   :      Optional[int]			 =					False
                            break
              if match_found:
                     position.append(_SCREAMING_SNAKE_CASE    )
       return position


if __name__ == "__main__":
       assert naive_pattern_search('ABCDEFG', 'DE') == [3]
       print(naive_pattern_search('ABAAABCDBBABCDDEBCABC', 'ABC'))






