
'''simple docstring'''






from __future__ import annotations




def 		a_( lowerCamelCase      )				->str:






       '''simple docstring'''




       lowercase  :		int						=      {1}
       lowercase  :		Optional[int]						=      [1]
       for _ in range(2   ,				depth + 1      ):
              lowercase  :		Optional[int]						=      [*previous_coefficients, 0]
              lowercase  :		Any						=      [0, *previous_coefficients]
              lowercase  :		Union[str, Any]						=      []
              for x, y in zip(__A   ,				__A      ):
                     coefficients.add(x + y      )
                     previous_coefficients.append(x + y      )
       return coefficients




def 		a_( lowerCamelCase      )				->Optional[Any]:






       '''simple docstring'''




       lowercase  :		int						=      set()
       for number in unique_coefficients:
              lowercase  :		Dict						=      2
              lowercase  :		str						=      number
              while divisor**2 <= copy_number:
                     lowercase  :		Dict						=      0
                     while copy_number % divisor == 0:
                            copy_number //= divisor
                            multiplicity += 1
                     if multiplicity >= 2:
                            non_squarefrees.add(__A      )
                            break
                     divisor += 1

       return unique_coefficients.difference(__A      )




def 		a_( lowerCamelCase = 51      )				->List[Any]:






       '''simple docstring'''




       lowercase  :		Optional[int]						=      get_pascal_triangle_unique_coefficients(__A      )
       lowercase  :		Optional[Any]						=      get_squarefrees(__A      )
       return sum(__A      )


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










'''simple docstring'''






def 		a_( lowerCamelCase   ,				lowerCamelCase      )				->list[tuple[int, int, int]]:






       '''simple docstring'''




       lowercase  :		Dict						=      sorted(lowerCamelCase   ,				key=lambda lowerCamelCase      : edge[2]      )

       lowercase  :		str						=      list(range(lowerCamelCase      )      )

       def find_parent(lowerCamelCase      ):
              if i != parent[i]:
                     lowercase  :		Optional[int]						=      find_parent(parent[i]      )
              return parent[i]

       lowercase  :		Union[str, Any]						=      0
       lowercase  :		Any						=      []

       for edge in edges:
              lowercase  :		Optional[Any]						=      find_parent(edge[0]      )
              lowercase  :		Any						=      find_parent(edge[1]      )
              if parent_a != parent_b:
                     minimum_spanning_tree_cost += edge[2]
                     minimum_spanning_tree.append(lowerCamelCase      )
                     lowercase  :		Optional[int]						=      parent_b

       return minimum_spanning_tree


if __name__ == "__main__":  # pragma: no cover
      lowercase	,	lowercase	:      List[Any]				=       list(map(int, input().strip().split()))
      lowercase	:      List[Any]				=       []

      for _ in range(num_edges):
            lowercase	,	lowercase	,	lowercase	:      Optional[Any]				=       (int(x) for x in input().strip().split())
            edges.append((nodea, nodea, cost))

      kruskal(num_nodes, edges)




