'''simple docstring'''

def        UpperCAmelCase__   (				_lowerCAmelCase    :			str,      _lowerCAmelCase    :			Union[str, Any])    ->		Optional[int]:



						"""simple docstring"""

						print("\nVertex Distance")
						for i in range(_lowerCAmelCase):
												if dist[i] != float("inf"):
																		print(_lowerCAmelCase,      "\t",      int(dist[i]),      end="\t")
												else:
																		print(_lowerCAmelCase,      "\t",      "INF",      end="\t")
												print()


def        UpperCAmelCase__   (				_lowerCAmelCase    :			Union[str, Any],      _lowerCAmelCase    :			Dict,      _lowerCAmelCase    :			List[Any])    ->		Optional[Any]:



						"""simple docstring"""

						snake_case :       Tuple				=    float("inf")
						snake_case :       Tuple				=    -1
						for i in range(_lowerCAmelCase):
												if (not vset[i]) and mdist[i] < min_val:
																		snake_case :       Optional[int]				=    i
																		snake_case :       List[Any]				=    mdist[i]
						return min_ind


def        UpperCAmelCase__   (				_lowerCAmelCase    :			Dict,      _lowerCAmelCase    :			Dict,      _lowerCAmelCase    :			Dict)    ->		Optional[int]:



						"""simple docstring"""

						snake_case :       Tuple				=    [float("inf") for _ in range(_lowerCAmelCase)]
						snake_case :       str				=    [False for _ in range(_lowerCAmelCase)]
						snake_case :       Dict				=    0.0

						for _ in range(v - 1):
												snake_case :       Dict				=    min_dist(_lowerCAmelCase,      _lowerCAmelCase,      _lowerCAmelCase)
												snake_case :       Optional[Any]				=    True

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

						print_dist(_lowerCAmelCase,      _lowerCAmelCase)


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

						A_	   = [[float("inf") for i in range(V)] for j in range(V)]

						for i in range(V):
												A_	   = 0.0

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

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






'''simple docstring'''

def        UpperCAmelCase__   (				_lowerCAmelCase    :			int = 400_0000)    ->		int:



						"""simple docstring"""

						snake_case :       List[Any]				=    1
						snake_case :       int				=    2
						snake_case :       List[str]				=    0
						while j <= n:
												if j % 2 == 0:
																		total += j
												snake_case				,					snake_case :       Any				=    j, i + j

						return total


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





