
def 				a						(							snake_case__:					int					):


				'''simple docstring'''
				lowercase_       =					[0] * len(snake_case__					)
				lowercase_       =					[]
				lowercase_       =					[1] * len(snake_case__					)

				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:
								lowercase_       =					queue.pop(0					)
								for x in graph[vertex]:
												indegree[x] -= 1

												if long_dist[vertex] + 1 > long_dist[x]:
																lowercase_       =					long_dist[vertex] + 1

												if indegree[x] == 0:
																queue.append(snake_case__					)

				print(max(snake_case__					)					)


# Adjacency list of Graph
__a  			=					{0: [2, 3, 4], 1: [2, 7], 2: [5], 3: [5, 7], 4: [7], 5: [6], 6: [7], 7: []}


longest_distance(graph)






import os




def 				a						(							):


				'''simple docstring'''
				lowercase_       =					os.path.join(os.path.dirname(snake_case__					)						,   '''num.txt'''					)
				with open(snake_case__					) as file_hand:
								return str(sum(int(snake_case__					) for line in file_hand					)					)[:10]


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




