
import math

def a__       (			A_,	A_   ):






  '''simple docstring'''





  if (
      not isinstance(A_,	(int, float)   )
      or power_factor < -1
      or power_factor > 1
  ):
    raise ValueError("""power_factor must be a valid float value between -1 and 1."""   )
  return apparent_power * power_factor

def a__       (			A_,	A_   ):






  '''simple docstring'''





  if (
      not isinstance(A_,	(int, float)   )
      or power_factor < -1
      or power_factor > 1
  ):
    raise ValueError("""power_factor must be a valid float value between -1 and 1."""   )
  return apparent_power * math.sqrt(1 - power_factor**2   )


if __name__ == "__main__":
    import doctest

    doctest.testmod()




def 			_A	(      SCREAMING_SNAKE_CASE      ):  # noqa: E741
	UpperCAmelCase__:	int									= len(SCREAMING_SNAKE_CASE      )
	UpperCAmelCase__:	Dict									= 0
	UpperCAmelCase__:	Optional[int]									= [0] * n
	UpperCAmelCase__:	List[str]									= [False] * n
	UpperCAmelCase__:	List[str]									= [False] * n

	def dfs(SCREAMING_SNAKE_CASE	,SCREAMING_SNAKE_CASE	,SCREAMING_SNAKE_CASE	,SCREAMING_SNAKE_CASE      ):
		if parent == root:
			out_edge_count += 1
		UpperCAmelCase__:	List[str]									= True
		UpperCAmelCase__:	List[Any]									= at

		for to in l[at]:
			if to == parent:
				pass
			elif not visited[to]:
				UpperCAmelCase__:	str									= dfs(SCREAMING_SNAKE_CASE	,SCREAMING_SNAKE_CASE	,SCREAMING_SNAKE_CASE	,SCREAMING_SNAKE_CASE      )
				UpperCAmelCase__:	Optional[Any]									= min(low[at]	,low[to]      )

				# AP found via bridge
				if at < low[to]:
					UpperCAmelCase__:	List[Any]									= True
				# AP found via cycle
				if at == low[to]:
					UpperCAmelCase__:	str									= True
			else:
				UpperCAmelCase__:	Union[str, Any]									= min(low[at]	,SCREAMING_SNAKE_CASE      )
		return out_edge_count

	for i in range(SCREAMING_SNAKE_CASE      ):
		if not visited[i]:
			UpperCAmelCase__:	Optional[Any]									= 0
			UpperCAmelCase__:	Union[str, Any]									= dfs(SCREAMING_SNAKE_CASE	,SCREAMING_SNAKE_CASE	,-1	,SCREAMING_SNAKE_CASE      )
			UpperCAmelCase__:	Tuple									= out_edge_count > 1

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


# Adjacency list of graph
_lowerCAmelCase  :      Any			 ={
    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)