




def 		__A		(	__lowerCamelCase    )      ->       str:  # noqa: E741
	a										=							len(__lowerCamelCase    )
	a										=							0
	a										=							[0] * n
	a										=							[False] * n
	a										=							[False] * n

	def dfs(__lowerCamelCase							,			__lowerCamelCase							,			__lowerCamelCase							,			__lowerCamelCase    ):
		if parent == root:
			out_edge_count += 1
		a										=							True
		a										=							at

		for to in l[at]:
			if to == parent:
				pass
			elif not visited[to]:
				a										=							dfs(__lowerCamelCase							,			__lowerCamelCase							,			__lowerCamelCase							,			__lowerCamelCase    )
				a										=							min(low[at]							,			low[to]    )

				# AP found via bridge
				if at < low[to]:
					a										=							True
				# AP found via cycle
				if at == low[to]:
					a										=							True
			else:
				a										=							min(low[at]							,			__lowerCamelCase    )
		return out_edge_count

	for i in range(__lowerCamelCase    ):
		if not visited[i]:
			a										=							0
			a										=							dfs(__lowerCamelCase							,			__lowerCamelCase							,			-1							,			__lowerCamelCase    )
			a										=							out_edge_count > 1

	for x in range(len(__lowerCamelCase    )    ):
		if is_art[x] is True:
			print(__lowerCamelCase    )


# Adjacency list of graph
__UpperCamelCase					:       List[str]    					=      {
    0: [1, 2],
    1: [0, 2],
    2: [0, 1, 3, 5],
    3: [2, 4],
    4: [3],
    5: [2, 6, 8],
    6: [5, 7],
    7: [6, 8],
    8: [5, 7],
}



compute_ap(data)







def 		__A		(	__lowerCamelCase    )      ->       int:
	a										=							hex_num.strip()
	if not hex_num:
		raise ValueError("""No value was passed to the function"""    )

	a										=							hex_num[0] == """-"""
	if is_negative:
		a										=							hex_num[1:]

	try:
		a										=							int(__lowerCamelCase							,			16    )
	except ValueError:
		raise ValueError("""Invalid value was passed to the function"""    )

	a										=							""""""
	while int_num > 0:
		a										=							str(int_num % 2    ) + bin_str
		int_num >>= 1

	return int(("""-""" + bin_str) if is_negative else bin_str    )


if __name__ == "__main__":
		import doctest

		doctest.testmod()

