CF656E.Out of Controls

You are given a complete undirected graph. For each pair of vertices you are given the length of the edge that connects them. Find the shortest paths between each pair of vertices in the graph and return the length of the longest of them.

给你一个完全无向图。对于每一对顶点，你都被给定了连接它们的边的长度。请找出图中每对顶点之间的最短路径，并返回其中最长的那条路径的长度。

The first line of the input contains a single integer N (3 ≤ N ≤ 10).

The following N lines each contain N space-separated integers. _j_th integer in _i_th line a__ij is the length of the edge that connects vertices i and j. a__ij = a__ji, a__ii = 0, 1 ≤ a__ij ≤ 100 for i ≠ j.

输入的第一行包含一个整数 $N$（$3 \leq N \leq 10$）。

接下来的 $N$ 行，每行包含 $N$ 个以空格分隔的整数。第 $i$ 行中的第 $j$ 个整数 $a_{ij}$ 表示连接顶点 $i$ 和顶点 $j$ 的边的长度。满足 $a_{ij} = a_{ji}$，$a_{ii} = 0$，且当 $i \neq j$ 时，$1 \leq a_{ij} \leq 100$。

Output the maximum length of the shortest path between any pair of vertices in the graph.

输出图中任意一对顶点之间最短路径的最大长度。

You're running short of keywords, so you can't use some of them:

define
do
for
foreach
while
repeat
until
if
then
else
elif
elsif
elseif
case
switch

关键词不足，因此无法使用以下部分关键词：

define
do
for
foreach
while
repeat
until
if
then
else
elif
elsif
elseif
case
switch