program lougras_mind;

 var
  h: array[1..8,1..8]of integer;
  n,i,j,i0,j0,t:integer;
  x,y,x0,y0: integer;
  dx,dy: array[1..8]of integer;

procedure kereskovlepes(i,x,y: integer);
var
u,v,k:integer;
 begin
 for k:=1 to 8 do
  begin
    u:=x+dx[k]; v:=y+dy[k];
    if (1<=u) and (u<=n) and (1<=v) and (v<=n) and (h[u,v]=0)
     then
     begin
      h[u,v]:=i;      {bejegyzes}
      if (i<n*n) then
        kereskovlepes(i+1,u,v)
      else
       begin  {kiiratas}
         t:=t+1;
         for i0:=1 to n  do
           begin
            for  j0:=1 to n do
             write(h[i0,j0]:3);
            writeln;
           end;
         writeln(t,'===============');{uj sor a tablak kozott}
       end;
       h[u,v]:=0; {torles}
     end;
    end;
 end;



BEGIN

x0:=1; y0:=1; n:=5; t:=0;
 for i:=1 to n  do
  for  j:=1 to n do
   h[i,j]:=0;
dx[1]:= 2; dy[1]:= 1;
dx[2]:= 1; dy[2]:= 2;
dx[3]:=-1; dy[3]:= 2;
dx[4]:=-2; dy[4]:= 1;
dx[5]:=-2; dy[5]:=-1;
dx[6]:=-1; dy[6]:=-2;
dx[7]:= 1; dy[7]:=-2;
dx[8]:= 2; dy[8]:=-1;


h[x0,y0]:=1;

kereskovlepes(2,x0,y0);
 writeln;
 readln;


END.