




'''simple docstring'''



def 				SCREAMING_SNAKE_CASE_				(							__A       :				Optional[int] ,  __A       :				int						)				->				int:
   print("\nVertex Distance"						)
   for i in range(__A						):
      if dist[i] != float("inf"						):
         print(__A ,  "\t" ,  int(dist[i]						) ,  end="\t"						)
      else:
         print(__A ,  "\t" ,  "INF" ,  end="\t"						)
      print()
def 				SCREAMING_SNAKE_CASE_				(							__A       :				List[str] ,  __A       :				str ,  __A       :				Optional[Any]						)				->				Optional[Any]:
   _SCREAMING_SNAKE_CASE =   float("inf"						)
   _SCREAMING_SNAKE_CASE =   -1
   for i in range(__A						):
      if (not vset[i]) and mdist[i] < min_val:
         _SCREAMING_SNAKE_CASE =   i
         _SCREAMING_SNAKE_CASE =   mdist[i]
   return min_ind
def 				SCREAMING_SNAKE_CASE_				(							__A       :				int ,  __A       :				str ,  __A       :				Any						)				->				int:
   _SCREAMING_SNAKE_CASE =   [float("inf"						) for _ in range(__A						)]
   _SCREAMING_SNAKE_CASE =   [False for _ in range(__A						)]
   _SCREAMING_SNAKE_CASE =   0.0

   for _ in range(v - 1						):
      _SCREAMING_SNAKE_CASE =   min_dist(__A ,  __A ,  __A						)
      _SCREAMING_SNAKE_CASE =   True

      for i in range(__A						):
         if (
             (not vset[i])
             and graph[u][i] != float("inf"						)
             and mdist[u] + graph[u][i] < mdist[i]
         ):
            _SCREAMING_SNAKE_CASE =   mdist[u] + graph[u][i]

   print_dist(__A ,  __A						)


if __name__ == "__main__":
 lowerCamelCase_	 =		int(input('Enter number of vertices: ').strip())
 lowerCamelCase_	 =		int(input('Enter number of edges: ').strip())

 lowerCamelCase_	 =		[[float('inf') for i in range(V)] for j in range(V)]

 for i in range(V):
  lowerCamelCase_	 =		0.0

 for i in range(E):
  print('\nEdge ', i + 1)
  lowerCamelCase_	 =		int(input('Enter source:').strip())
  lowerCamelCase_	 =		int(input('Enter destination:').strip())
  lowerCamelCase_	 =		float(input('Enter weight:').strip())
  lowerCamelCase_	 =		weight

 lowerCamelCase_	 =		int(input('\nEnter shortest path source:').strip())
 dijkstra(graph, V, gsrc)







'''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}''')

