program graph3;

{$APPTYPE CONSOLE}
 var  m,n:integer;

 c:array [1..100,1..100] of integer;
kol,s,smin,kk,k,im,np,i,j:integer;
 	 rez,stack:array [0..100] of integer;
f1,f2:text;
function f:boolean;
var ii:integer; p:boolean;
begin
p:=true;
for ii:=0 to im-1 do
if (np=stack[ii])then p:=false;
f:=p;
end;
procedure outresalt;
 var p,i:integer;
 vv:boolean;
 	begin
{перевірка}
vv:=true;
i:=0;
while i<m-1 do begin
for j:=i+1 to m-1 do
if (stack[i]=stack[j])and(stack[i+1]=stack[j+1])
or (stack[i+1]=stack[j])and(stack[i]=stack[j+1])
 then vv:=false;
i:=i+1;
end;
if vv then begin
      for i:=0 to m do write(f2,stack[i]);
      writeln(f2);
      kol:=kol+1;
 	end;
end;


 begin
assign(f1,'graph.dat');
Reset(f1);
assign(f2,'graph.sol');
rewrite(f2);

readln(f1,n);
for i:=1 to n do
for j:=1 to n do read(f1,c[i,j]);
m:=0;
 for i:=1 to n do
 for j:=1 to n do if c[i,j]>=1 then m:=m+1;

m:=m div 2;
 for k:=1 to n do begin

                        stack[0]:=k;
                         im:=1;
                          np:=1;
                           while im>0  do begin
                            while ((np<=n)and(c[stack[im-1],np]=0)) do  np:=np+1;


                             if (np>n) then begin im:=im-1; np:=stack[im]+1; end
                             else
                               begin

                                  stack[im]:=np;
                                  im:=im+1;
                                  np:=1;



                                  if im-1=m then begin outresalt;im:=im-1;np:=stack[im]+1;end
                                  end;


 		                  end;

                       end;


writeln(f2,'kol=',kol);
CLOSE(F2);

  end.