code: 
  def 						lowerCAmelCase_		(      _snake_case   :						int = 1000     )       ->	int:
  
  
  
  
  
  
  
  	'''simple docstring'''
  
  
  	__magic_name__	:	Optional[int]			     =  0
  	__magic_name__	:	Union[str, Any]			     =  0
  	while 1:
  		num += 3
  		if num >= n:
  			break
  		total += num
  		num += 2
  		if num >= n:
  			break
  		total += num
  		num += 1
  		if num >= n:
  			break
  		total += num
  		num += 3
  		if num >= n:
  			break
  		total += num
  		num += 1
  		if num >= n:
  			break
  		total += num
  		num += 2
  		if num >= n:
  			break
  		total += num
  		num += 3
  		if num >= n:
  			break
  		total += num
  	return total
  
  
  if __name__ == "__main__":
  				print(F"{solution() = }")
  
style_context: 
  def 						lowerCAmelCase_		(      _snake_case   :						int   ,     _snake_case   :						list[tuple[int, int, int]]     )       ->	list[tuple[int, int, int]]:
  
  
  
  
  
  
  
  	'''simple docstring'''
  
  
  	__magic_name__	:	Union[str, Any]			     =  sorted(_snake_case   ,     key=lambda _snake_case     : edge[2]     )
  
  	__magic_name__	:	Union[str, Any]			     =  list(range(_snake_case     )     )
  
  	def find_parent(_snake_case   :						Dict     ):
  		if i != parent[i]:
  			__magic_name__	:	Any			     =  find_parent(parent[i]     )
  		return parent[i]
  
  	__magic_name__	:	List[str]			     =  0
  	__magic_name__	:	int			     =  []
  
  	for edge in edges:
  		__magic_name__	:	Any			     =  find_parent(edge[0]     )
  		__magic_name__	:	int			     =  find_parent(edge[1]     )
  		if parent_a != parent_b:
  			minimum_spanning_tree_cost += edge[2]
  			minimum_spanning_tree.append(_snake_case     )
  			__magic_name__	:	Optional[int]			     =  parent_b
  
  	return minimum_spanning_tree
  
  
  if __name__ == "__main__":  # pragma: no cover
  				snake_case   ,snake_case				:	int							   =						list(map(int, input().strip().split()))
  				snake_case				:	int							   =						[]
  
  				for _ in range(num_edges):
  								snake_case   ,snake_case   ,snake_case				:	Dict							   =						(int(x) for x in input().strip().split())
  								edges.append((nodea, nodea, cost))
  
  				kruskal(num_nodes, edges)
  