


def   _lowerCAmelCase				(   UpperCamelCase__:     Optional[Any]							,					UpperCamelCase__:     str						) ->   List[str]:





	"""simple docstring"""







	A								=				0
	A								=				len(UpperCamelCase__						) - 1

	while left <= right:
		# avoid divided by 0 during interpolation
		if sorted_collection[left] == sorted_collection[right]:
			if sorted_collection[left] == item:
				return left
			else:
				return None

		A								=				left + ((item - sorted_collection[left]) * (right - left)) // (
		    sorted_collection[right] - sorted_collection[left]
		)

		# out of range check
		if point < 0 or point >= len(UpperCamelCase__						):
			return None

		A								=				sorted_collection[point]
		if current_item == item:
			return point
		else:
			if point < left:
				A								=				left
				A								=				point
			elif point > right:
				A								=				right
				A								=				point
			else:
				if item < current_item:
					A								=				point - 1
				else:
					A								=				point + 1
	return None





def   _lowerCAmelCase				(   UpperCamelCase__:     Tuple							,					UpperCamelCase__:     int							,					UpperCamelCase__:     int							,					UpperCamelCase__:     Optional[Any]						) ->   Union[str, Any]:





	"""simple docstring"""







	if sorted_collection[left] == sorted_collection[right]:
		if sorted_collection[left] == item:
			return left
		else:
			return None

	A								=				left + ((item - sorted_collection[left]) * (right - left)) // (
	    sorted_collection[right] - sorted_collection[left]
	)

	# out of range check
	if point < 0 or point >= len(UpperCamelCase__						):
		return None

	if sorted_collection[point] == item:
		return point
	elif point < left:
		return interpolation_search_by_recursion(UpperCamelCase__							,					UpperCamelCase__							,					UpperCamelCase__							,					UpperCamelCase__						)
	elif point > right:
		return interpolation_search_by_recursion(UpperCamelCase__							,					UpperCamelCase__							,					UpperCamelCase__							,					UpperCamelCase__						)
	else:
		if sorted_collection[point] > item:
			return interpolation_search_by_recursion(
			    UpperCamelCase__							,					UpperCamelCase__							,					UpperCamelCase__							,					point - 1						)
		else:
			return interpolation_search_by_recursion(
			    UpperCamelCase__							,					UpperCamelCase__							,					point + 1							,					UpperCamelCase__						)





def   _lowerCAmelCase				(   UpperCamelCase__:     Dict						) ->   Tuple:





	"""simple docstring"""







	if collection != sorted(UpperCamelCase__						):
		raise ValueError("""Collection must be ascending sorted"""						)
	return True


if __name__ == "__main__":
				import sys
				_lowercase       :      Tuple	=	0
				if debug == 1:
								_lowercase       :      Union[str, Any]	=	[10, 30, 40, 45, 50, 66, 77, 93]
								try:
												__assert_sorted(collection)
								except ValueError:
												sys.exit("Sequence must be ascending sorted to apply interpolation search")
								_lowercase       :      Optional[int]	=	67

				_lowercase       :      Optional[Any]	=	interpolation_search(collection, target)
				if result is not None:
								print(f'''{target} found at positions: {result}''')
				else:
								print("Not found")







import sys
from collections import defaultdict






class       _UpperCamelCase    :

				"""simple docstring"""







				def __init__(						self   )	->				Any:
					A								=				[]

				def      _UpperCAmelCase					(						self				,   a__   )	->				List[str]:
					return self.node_position[vertex]

				def      _UpperCAmelCase					(						self				,   a__				,   a__   )	->				Optional[int]:
					A								=				pos

				def      _UpperCAmelCase					(						self				,   a__				,   a__				,   a__				,   a__   )	->				Any:
					if start > size // 2 - 1:
						return
					else:
						if 2 * start + 2 >= size:
							A								=				2 * start + 1
						else:
							if heap[2 * start + 1] < heap[2 * start + 2]:
								A								=				2 * start + 1
							else:
								A								=				2 * start + 2
						if heap[smallest_child] < heap[start]:
							A					,			A								=				heap[smallest_child], positions[smallest_child]
							A					,			A								=				(
							    heap[start],
							    positions[start],
							)
							A					,			A								=				temp, tempa

							A								=				self.get_position(positions[smallest_child]   )
							self.set_position(
							    positions[smallest_child]				,   self.get_position(positions[start]   )   )
							self.set_position(positions[start]				,   a__   )

							self.top_to_bottom(a__				,   a__				,   a__				,   a__   )

				def      _UpperCAmelCase					(						self				,   a__				,   a__				,   a__				,   a__   )	->				Dict:
					A								=				position[index]

					while index != 0:
						A								=				int((index - 2) / 2   ) if index % 2 == 0 else int((index - 1) / 2   )

						if val < heap[parent]:
							A								=				heap[parent]
							A								=				position[parent]
							self.set_position(position[parent]				,   a__   )
						else:
							A								=				val
							A								=				temp
							self.set_position(a__				,   a__   )
							break
						A								=				parent
					else:
						A								=				val
						A								=				temp
						self.set_position(a__				,   0   )

				def      _UpperCAmelCase					(						self				,   a__				,   a__   )	->				Optional[int]:
					A								=				len(a__   ) // 2 - 1
					for i in range(a__				,   -1				,   -1   ):
						self.top_to_bottom(a__				,   a__				,   len(a__   )				,   a__   )

				def      _UpperCAmelCase					(						self				,   a__				,   a__   )	->				Any:
					A								=				positions[0]
					A								=				sys.maxsize
					self.top_to_bottom(a__				,   0				,   len(a__   )				,   a__   )
					return temp





def   _lowerCAmelCase				(   UpperCamelCase__:     List[str]						) ->   List[str]:





	"""simple docstring"""







	A								=				Heap()

	A								=				[0] * len(UpperCamelCase__						)
	A								=				[-1] * len(UpperCamelCase__						)  # Neighboring Tree Vertex of selected vertex
	# Minimum Distance of explored vertex with neighboring vertex of partial tree
	# formed in graph
	A								=				[]  # Heap of Distance of vertices from their neighboring vertex
	A								=				[]

	for vertex in range(len(UpperCamelCase__						)						):
		distance_tv.append(sys.maxsize						)
		positions.append(UpperCamelCase__						)
		heap.node_position.append(UpperCamelCase__						)

	A								=				[]
	A								=				1
	A								=				sys.maxsize
	for neighbor, distance in adjacency_list[0]:
		A								=				0
		A								=				distance
	heap.heapify(UpperCamelCase__							,					UpperCamelCase__						)

	for _ in range(1							,					len(UpperCamelCase__						)						):
		A								=				heap.delete_minimum(UpperCamelCase__							,					UpperCamelCase__						)
		if visited[vertex] == 0:
			tree_edges.append((nbr_tv[vertex], vertex)						)
			A								=				1
			for neighbor, distance in adjacency_list[vertex]:
				if (
				    visited[neighbor] == 0
				    and distance < distance_tv[heap.get_position(UpperCamelCase__						)]
				):
					A								=				distance
					heap.bottom_to_top(
					    UpperCamelCase__							,					heap.get_position(UpperCamelCase__						)							,					UpperCamelCase__							,					UpperCamelCase__						)
					A								=				vertex
	return tree_edges


if __name__ == "__main__":  # pragma: no cover
				# < --------- Prims Algorithm --------- >
				_lowercase       :      Tuple	=	int(input("Enter number of edges: ").strip())
				_lowercase       :      int	=	defaultdict(list)
				for _ in range(edges_number):
								_lowercase       :      Optional[Any]	=	[int(x) for x in input().strip().split()]
								adjacency_list[edge[0]].append([edge[1], edge[2]])
								adjacency_list[edge[1]].append([edge[0], edge[2]])
				print(prisms_algorithm(adjacency_list))



