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.

-----Input-----

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

The following N lines each contain N space-separated integers. jth integer in ith 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.

-----Output-----

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

-----Examples-----

Input 3 0 1 1 1 0 4 1 4 0

Output 2

Input 4 0 1 2 3 1 0 4 5 2 4 0 6 3 5 6 0

Output 5

-----Note-----

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