




'''simple docstring'''



def 				SCREAMING_SNAKE_CASE_				(							__A       :				Any ,  __A       :				Optional[Any]						)				->				list[tuple[int, int, int]]:
     _SCREAMING_SNAKE_CASE =   sorted(__A ,  key=lambda __A						: edge[2]						)

     _SCREAMING_SNAKE_CASE =   list(range(__A						)						)

     def find_parent(__A       :				Any						):
          if i != parent[i]:
               _SCREAMING_SNAKE_CASE =   find_parent(parent[i]						)
          return parent[i]

     _SCREAMING_SNAKE_CASE =   0
     _SCREAMING_SNAKE_CASE =   []

     for edge in edges:
          _SCREAMING_SNAKE_CASE =   find_parent(edge[0]						)
          _SCREAMING_SNAKE_CASE =   find_parent(edge[1]						)
          if parent_a != parent_b:
               minimum_spanning_tree_cost += edge[2]
               minimum_spanning_tree.append(__A						)
               _SCREAMING_SNAKE_CASE =   parent_b

     return minimum_spanning_tree


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

 for _ in range(num_edges):
  lowerCamelCase_ ,       lowerCamelCase_ ,       lowerCamelCase_	 =		(int(x) for x in input().strip().split())
  edges.append((nodea, nodea, cost))

 kruskal(num_nodes, edges)







'''simple docstring'''



import math
def 				SCREAMING_SNAKE_CASE_				(							__A       :				Tuple						)				->				List[Any]:
   _SCREAMING_SNAKE_CASE =   0
   if n % 2 == 0:
      count += 1
      while n % 2 == 0:
         _SCREAMING_SNAKE_CASE =   int(n / 2						)
    # the n input value must be odd so that
    # we can skip one element (ie i += 2)

   _SCREAMING_SNAKE_CASE =   3

   while i <= int(math.sqrt(__A						)						):
      if n % i == 0:
         count += 1
         while n % i == 0:
            _SCREAMING_SNAKE_CASE =   int(n / i						)
      _SCREAMING_SNAKE_CASE =   i + 2

   # this condition checks the prime
   # number n is greater than 2

   if n > 2:
      count += 1
   return count


if __name__ == "__main__":
 lowerCamelCase_	 =		51_24_21_83
 print(f'''The number of distinct prime factors is/are {exact_prime_factor_count(n)}''')
 print(f'''The value of log(log(n)) is {math.log(math.log(n)):.4f}''')

