



'''simple docstring'''
def A__    (     UpperCAmelCase_							):
						_UpperCamelCase					:		str 				=   [0] * len(UpperCAmelCase_							)
						_UpperCamelCase					:		Any 				=   []
						_UpperCamelCase					:		Optional[int] 				=   []
						_UpperCamelCase					:		List[str] 				=   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					:		Any 				=   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
snake_case_ :	List[str]         =  {0: [1, 2], 1: [3], 2: [3], 3: [4, 5], 4: [], 5: []}

topological_sort(graph)








'''simple docstring'''







import os





def 						snake_case_							():
    UpperCAmelCase			       =		os.path.join(os.path.dirname(_a     )    ,   '''num.txt'''     )
    with open(_a     ) as file_hand:
        return str(sum(int(_a     ) for line in file_hand     )     )[:1_0]


if __name__ == "__main__":
   print(solution())




