def  snake_case						(__lowercase						)	->	int:

						'''simple docstring'''



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

						_snake_case						:					Union[str, Any]    =   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()
from __future__ import annotations

from collections import deque
from collections.abc import Iterator
from dataclasses import dataclass



@dataclass
class        lowercase_   :
							_lowerCamelCase						=		42
							_lowerCamelCase						=		42




class        lowercase_   :



							def __init__(						self				,    lowercase_    ):
													_snake_case						:					list[list[Edge]]    =   [[] for _ in range(lowercase_    )]
													_snake_case						:					Union[str, Any]    =   size



							def __getitem__(						self				,    lowercase_    ):
													return iter(self._graph[vertex]    )



							@property
							def 	UpperCamelCase	(						self    ):
													return self._size



							def 	UpperCamelCase	(						self				,    lowercase_				,    lowercase_				,    lowercase_    ):
													if weight not in (0, 1):
																			raise ValueError("Edge weight must be either 0 or 1."    )

													if to_vertex < 0 or to_vertex >= self.size:
																			raise ValueError("Vertex indexes must be in [0; size)."    )

													self._graph[from_vertex].append(Edge(lowercase_				,    lowercase_    )    )



							def 	UpperCamelCase	(						self				,    lowercase_				,    lowercase_    ):
													_snake_case						:					Optional[int]    =   deque([start_vertex]    )
													_snake_case						:					list[int | None]    =   [None] * self.size
													_snake_case						:					Tuple    =   0

													while queue:
																			_snake_case						:					List[Any]    =   queue.popleft()
																			_snake_case						:					Tuple    =   distances[current_vertex]
																			if current_distance is None:
																									continue

																			for edge in self[current_vertex]:
																									_snake_case						:					Dict    =   current_distance + edge.weight
																									_snake_case						:					str    =   distances[edge.destination_vertex]
																									if (
																									    isinstance(lowercase_				,    lowercase_    )
																									    and new_distance >= dest_vertex_distance
																									):
																															continue
																									_snake_case						:					List[Any]    =   new_distance
																									if edge.weight == 0:
																															queue.appendleft(edge.destination_vertex    )
																									else:
																															queue.append(edge.destination_vertex    )

													if distances[finish_vertex] is None:
																			raise ValueError("No path from start_vertex to finish_vertex."    )

													return distances[finish_vertex]


if __name__ == "__main__":
				import doctest

				doctest.testmod()