


from collections import defaultdict

from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst



def UpperCamelCase_				(				)	->   Optional[Any]:
      a__,	a__	:  Tuple     =   9, 14  # noqa: F841
      a__	:  int     =   [
          [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__	:  str     =   defaultdict(__a      )
      for nodea, nodea, cost in edges:
            adjancency[nodea].append([nodea, cost]      )
            adjancency[nodea].append([nodea, cost]      )

      a__	:  Union[str, Any]     =   mst(__a      )

      a__	:  str     =   [
          [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__	:  List[str]     =   tuple(answer[:2]      )
            a__	:  Any     =   tuple(edge[::-1]      )
            assert edge in result or reverse in result




import math


def 					_UpperCAmelCase				(						a__ = 1_0_0):

			'''simple docstring'''



			a_						:						List[str] 							= sum(i * i for i in range(1  ,	n + 1))
			a_						:						Optional[Any] 							= int(math.pow(sum(range(1  ,	n + 1))  ,	2))
			return square_of_sum - sum_of_squares


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


