program saddasdasdasd;
const infinit=maxint;
type vect=array[1..1000]of integer;
     mat=array[1..1000,1..1000]of integer;
var d,tata:mat;
    n,m,cost,i,j,k,x,y,start,finish:integer;
    f,g:text;
procedure initializare;
var i,j:integer;
begin
for i:=1 to n do
  begin
  for j:=1 to n do read(f,d[i,j]);
  readln(f);
  end;

end;

procedure drumuri(var d:mat);
begin
for k:=1 to n do
 for i:=1 to n do
  for j:=1 to n do
    if (d[i,k]<>infinit)and(d[k,j]<>infinit) then
     if d[i,j]>d[i,k]+d[k,j] then
                                 d[i,j]:=d[i,k]+d[k,j];
end;

procedure afisare_drum;
var dr:vect; lg,i:integer;
begin
for i:=1 to n do
 begin
 for j:=1 to n do write(g,d[i,j],' ');
 writeln(g);
 end;
end;
begin
assign(f,'d-fw.in');reset(f);
assign(g,'d-fw.out');rewrite(g);
readln(f,n);
initializare;
drumuri(d);
afisare_drum;
close(f);close(g);
end.