


class 			lowerCamelCase_					:





							def __init__(							self    ):
								a_     			=   [0, 1]





							def   __magic_name__      (							self			,       _SCREAMING_SNAKE_CASE    ):
								if (difference := index - (len(self.sequence    ) - 2)) >= 1:
									for _ in range(_SCREAMING_SNAKE_CASE    ):
										self.sequence.append(self.sequence[-1] + self.sequence[-2]    )
								return self.sequence[:index]







def 			__SCREAMING_SNAKE_CASE		(		)     ->	None:



	"""simple docstring"""






	print(
	    """Fibonacci Series Using Dynamic Programming\n"""     ,					"""Enter the index of the Fibonacci number you want to calculate """     ,					"""in the prompt below. (To exit enter exit or Ctrl-C)\n"""     ,					sep=""""""     ,					)
	a_     			=   Fibonacci()

	while True:
		a_     			=   input(""">> """	)
		if prompt in {"exit", "quit"}:
			break

		try:
			a_     			=   int(UpperCamelCase	)
		except ValueError:
			print("""Enter a number or 'exit'"""	)
			continue

		print(fibonacci.get(UpperCamelCase	)	)


if __name__ == "__main__":
			main()



def 			__SCREAMING_SNAKE_CASE		(		UpperCamelCase		:      int     ,					UpperCamelCase		:      list[tuple[int, int, int]]	)     ->	list[tuple[int, int, int]]:



	"""simple docstring"""






	a_     			=   sorted(UpperCamelCase     ,					key=lambda UpperCamelCase	: edge[2]	)

	a_     			=   list(range(UpperCamelCase	)	)

	def find_parent(UpperCamelCase		:      Any	):
		if i != parent[i]:
			a_     			=   find_parent(parent[i]	)
		return parent[i]

	a_     			=   0
	a_     			=   []

	for edge in edges:
		a_     			=   find_parent(edge[0]	)
		a_     			=   find_parent(edge[1]	)
		if parent_a != parent_b:
			minimum_spanning_tree_cost += edge[2]
			minimum_spanning_tree.append(UpperCamelCase	)
			a_     			=   parent_b

	return minimum_spanning_tree


if __name__ == "__main__":  # pragma: no cover
			_A     ,				_A							     =       list(map(int, input().strip().split()))
			_A							     =       []

			for _ in range(num_edges):
						_A     ,				_A     ,				_A							     =       (int(x) for x in input().strip().split())
						edges.append((nodea, nodea, cost))

			kruskal(num_nodes, edges)