



def 				A				(					_lowerCamelCase  ):





							'''simple docstring'''




							_lowerCAmelCase     :							Union[str, Any]    =    [0] * len(snake_case_  )
							_lowerCAmelCase     :							Any    =    []
							_lowerCAmelCase     :							Optional[Any]    =    []
							_lowerCAmelCase     :							List[str]    =    0

							for values in graph.values():
														for i in values:
																					indegree[i] += 1

							for i in range(len(snake_case_  )  ):
														if indegree[i] == 0:
																					queue.append(snake_case_  )

							while queue:
														_lowerCAmelCase     :							int    =    queue.pop(0  )
														cnt += 1
														topo.append(snake_case_  )
														for x in graph[vertex]:
																					indegree[x] -= 1
																					if indegree[x] == 0:
																												queue.append(snake_case_  )

							if cnt != len(snake_case_  ):
														print("Cycle exists"  )
							else:
														print(snake_case_  )


# Adjacency List of Graph
_snake_case		=  {0: [1, 2], 1: [3], 2: [3], 3: [4, 5], 4: [], 5: []}



topological_sort(graph)







from math import loga






def lowerCamelCase__    (							snake_case_	:  int       )      ->				int:
   if a < 0:
      raise ValueError('''Input value must be a positive integer'''       )
   elif isinstance(snake_case_       ,      snake_case_       ):
      raise TypeError('''Input value must be a \'int\' type'''       )
   return 0 if (a == 0) else int(loga(a & -a       )       )


if __name__ == "__main__":
    import doctest

    doctest.testmod()

