






from collections import defaultdict

from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst







def      snake_case		(							):
				A ,		A	 =      9, 14  # noqa: F841
				A	 =      [
				    [0, 1, 4],
				    [0, 7, 8],
				    [1, 2, 8],
				    [7, 8, 7],
				    [7, 6, 1],
				    [2, 8, 2],
				    [8, 6, 6],
				    [2, 3, 7],
				    [2, 5, 4],
				    [6, 5, 2],
				    [3, 5, 14],
				    [3, 4, 9],
				    [5, 4, 10],
				    [1, 7, 11],
				]

				A	 =      defaultdict(UpperCAmelCase   )
				for nodea, nodea, cost in edges:
								adjancency[nodea].append([nodea, cost]   )
								adjancency[nodea].append([nodea, cost]   )

				A	 =      mst(UpperCAmelCase   )

				A	 =      [
				    [7, 6, 1],
				    [2, 8, 2],
				    [6, 5, 2],
				    [0, 1, 4],
				    [2, 5, 4],
				    [2, 3, 7],
				    [0, 7, 8],
				    [3, 4, 9],
				]

				for answer in expected:
								A	 =      tuple(answer[:2]   )
								A	 =      tuple(edge[::-1]   )
								assert edge in result or reverse in result













def      snake_case		(							UpperCAmelCase	:       int   ):
				A	 =      0
				while num > 0:
								digit_sum += num % 10
								num //= 10
				return digit_sum







def      snake_case		(							UpperCAmelCase	:       int = 1_00   ):
				A	 =      1
				A	 =      2

				for i in range(2,						max_n + 1   ):
								A	 =      pre_numerator
								A	 =      2 * i // 3 if i % 3 == 0 else 1
								A	 =      cur_numerator
								A	 =      e_cont * pre_numerator + temp

				return sum_digits(UpperCAmelCase   )


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





