





"""simple docstring"""





def 					__A  (_SCREAMING_SNAKE_CASE     )   ->int:





  """simple docstring"""


  lowerCAmelCase__     :Any											=				[0] * len(_SCREAMING_SNAKE_CASE     )
  lowerCAmelCase__     :str											=				[]
  lowerCAmelCase__     :Dict											=				[]
  lowerCAmelCase__     :Tuple											=				0

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

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

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

  if cnt != len(_SCREAMING_SNAKE_CASE     ):
    print('Cycle exists'     )
  else:
    print(_SCREAMING_SNAKE_CASE     )


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




topological_sort(graph)








"""simple docstring"""
from maths.prime_check import is_prime


def 							A						(				__snake_case: int  )    ->		int:

       """simple docstring"""





       if not isinstance(__snake_case ,     __snake_case  ):
              __magic_name__      				=    F"""Input value of [number={number}] must be an integer"""
              raise TypeError(__snake_case  )
       if is_prime(__snake_case  ) and is_prime(number + 2  ):
              return number + 2
       else:
              return -1


if __name__ == "__main__":
 import doctest

 doctest.testmod()