Second Shortest Path Length

Print the length of the second shortest walk (strictly longer than the shortest) from node 1 to node n in an undirected weighted graph. A walk may repeat nodes and edges.

2 <= n <= 5000