
from collections import defaultdict

from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst

def 		UpperCamelCase	(      )		->	Optional[int]:


  '''simple docstring'''






  lowercase__		,    lowercase__  :   Optional[int]    		=      9, 14  # noqa: F841
  lowercase__  :   List[str]    		=      [
      [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],
  ]

  lowercase__  :   Optional[int]    		=      defaultdict(lowercase_   )
  for nodea, nodea, cost in edges:
    adjancency[nodea].append([nodea, cost]   )
    adjancency[nodea].append([nodea, cost]   )

  lowercase__  :   Dict    		=      mst(lowercase_   )

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








def 		UpperCamelCase	(      lowercase_ = 10_00   )		->	int:


  '''simple docstring'''






  return sum(2 * a * ((a - 1) // 2) for a in range(3 , n + 1   )   )


if __name__ == "__main__":
     print(solution())






