


def 				lowerCamelCase__	(      a	:   str				)    ->	str:





			"""simple docstring"""
			a__ :Optional[int]						  =    [0] * len(a				)
			a__ :Optional[Any]						  =    []
			a__ :List[Any]						  =    []
			a__ :Tuple						  =    0

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

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

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

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


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







topological_sort(graph)






def 				lowerCamelCase__	(      a	:   int = 100				)    ->	int:





			"""simple docstring"""
			a__ :Tuple						  =    n * (n + 1) * (2 * n + 1) / 6
			a__ :Tuple						  =    (n * (n + 1) / 2) ** 2
			return int(square_of_sum - sum_of_squares				)


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


