






def   lowerCamelCase__			(     lowercase				):

  """simple docstring"""






  if isinstance(lowercase						,     lowercase				):
    raise TypeError("'float' object cannot be interpreted as an integer"				)
  if isinstance(lowercase						,     lowercase				):
    raise TypeError("'str' object cannot be interpreted as an integer"				)

  if num == 0:
    return "0b0"

  SCREAMING_SNAKE_CASE       :      Union[str, Any]							=    False

  if num < 0:
    SCREAMING_SNAKE_CASE       :      Optional[int]							=    True
    SCREAMING_SNAKE_CASE       :      int							=    -num

  SCREAMING_SNAKE_CASE       :      list[int]							=    []
  while num > 0:
    binary.insert(0						,     num % 2				)
    num >>= 1

  if negative:
    return "-0b" + "".join(str(lowercase				) for e in binary				)

  return "0b" + "".join(str(lowercase				) for e in binary				)


if __name__ == "__main__":
   import doctest

   doctest.testmod()














def   lowerCamelCase__			(     lowercase				):

  """simple docstring"""






  SCREAMING_SNAKE_CASE       :      Dict							=    [0] * len(lowercase				)
  SCREAMING_SNAKE_CASE       :      List[str]							=    []
  SCREAMING_SNAKE_CASE       :      Optional[Any]							=    []
  SCREAMING_SNAKE_CASE       :      Any							=    0

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

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

  while queue:
    SCREAMING_SNAKE_CASE       :      Optional[Any]							=    queue.pop(0				)
    cnt += 1
    topo.append(lowercase				)
    for x in graph[vertex]:
      indegree[x] -= 1
      if indegree[x] == 0:
        queue.append(lowercase				)

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


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

topological_sort(graph)






