
def 				SCREAMING_SNAKE_CASE_   (      UpperCamelCase__		):
      UpperCamelCase__     : Tuple											=					[0] * len(UpperCamelCase__		)
      UpperCamelCase__     : str											=					[]
      UpperCamelCase__     : Optional[Any]											=					[]
      UpperCamelCase__     : Dict											=					0

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

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

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

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


# Adjacency List of Graph
lowerCamelCase  ={0: [1, 2], 1: [3], 2: [3], 3: [4, 5], 4: [], 5: []}
topological_sort(graph)




def 				SCREAMING_SNAKE_CASE_   (      UpperCamelCase__ = 2_0_0_0_0_0_0		):
      UpperCamelCase__     : Dict											=					[0 for i in range(n + 1		)]
      UpperCamelCase__     : Any											=					1
      UpperCamelCase__     : int											=					1

      for i in range(2			,		int(n**0.5		) + 1		):
            if primality_list[i] == 0:
                  for j in range(i * i			,		n + 1			,		UpperCamelCase__		):
                        UpperCamelCase__     : Any											=					1
      UpperCamelCase__     : Optional[Any]											=					0
      for i in range(UpperCamelCase__		):
            if primality_list[i] == 0:
                  sum_of_primes += i
      return sum_of_primes


if __name__ == "__main__":
    print(F'''{solution() = }''')


