program Project2;

{$APPTYPE CONSOLE}


type map=array[0..1000,0..1000] of integer;
     data=array[0..100*100-1] of integer;
var w,h:map;
ii,temp,size,x,y,x1,y1,x2,y2,i,j,point,level,min,max,len:integer;
    a,b:data;
f:text;
ch:char;
function ok:boolean;
var o:boolean;
begin
o:=true;
case a[point] of
 1: o:=(x>1) and (abs(w[x,y]-w[x-1,y])<=size) and (h[x-1,y]=0);
 2: o:=(x<size) and (abs(w[x,y]-w[x+1,y])<=size) and (h[x+1,y]=0);
 3: o:=(y>1) and (abs(w[x,y]-w[x,y-1])<=size) and (h[x,y-1]=0);
 4: o:=(y<size) and (abs(w[x,y]-w[x,y+1])<=size) and (h[x,y+1]=0);
       end; {case}
ok:=o;
end;


BEGIN
for ch:='1' to '9' do
begin
assign(f,'karavan'+ch+'.dat');
rewrite(f);
size:=(ord(ch)-47);
writeln(f,size);
randomize;
for i:=1 to size do
for j:=1 to size do
begin
writeln(f,i,' ',j,' ',random(size));
end;
writeln(f,random(size)+1,' ',random(size)+1);
writeln(f,random(size)+1,' ',random(size)+1);
close(f);
assign(f,'karavan'+ch+'.dat');
reset(f);
readln(f,size);
for ii:=1 to size*size do
         begin
         read(f,i,j,temp);
         w[i,j]:=temp;
         h[i,j]:=0;
         end;

{for i:=1 to size do
    begin
    for j:=1 to size do
        write(w[i,j]:3,' ');
    writeln;
    writeln('-----------------------------');
    end;
    
readln; }
readln(f,x1,y1);
readln(f,x2,y2);
close(f);
x:=x1;
y:=y1;
h[x,y]:=1;
point:=1;
level:=maxint;
for i:=1 to size*size-1 do
    a[i]:=0;
repeat {Коды направлений 1-север, 2-юг, 3-запад, 4-восток}
   repeat
     a[point]:=a[point]+1
   until ok;
   if a[point]<=4
      then begin
           h[x,y]:=1;
           case a[point] of
            1: dec(x);
            2: inc(x);
            3: dec(y);
            4: inc(y);
                 end; {case}
           point:=point+1
           end
      else begin
           h[x,y]:=0;
           a[point]:=0;
           point:=point-1;
           case a[point] of
            1: inc(x);
            2: dec(x);
            3: inc(y);
            4: dec(y);
                 end; {case}
           end;
   if (x=x2) and (y=y2)  {Ура! Дошли!}
      then begin
           x:=x1;
           y:=y1;
           min:=w[x,y];
           max:=w[x,y];
           for i:=1 to point-1 do {}
               begin
               case a[i] of
            1: dec(x);
            2: inc(x);
            3: dec(y);
            4: inc(y);
                 end; {case}
               if max<w[x,y]
                  then max:=w[x,y];
               if min>w[x,y]
                  then min:=w[x,y];
               end;
           h[x,y]:=0;
           if level>(max-min)
              then begin
                   len:=point-1;
                   level:=max-min;
                   b:=a;
                   end;
           end;
   if (point>=size*size) {Идти некуда}
      then begin
           point:=size*size-1;
           h[x,y]:=0;
           a[point]:=0;
           point:=point-1;
           case a[point] of
            1: inc(x);
            2: dec(x);
            3: inc(y);
            4: dec(y);
                 end; {case}
           end;
until point=0;
assign(f,'karavan'+ch+'.sol');
rewrite(f);
if level=maxint
   then writeln(f,'NO')
   else writeln(f,level);
   close(f);
   writeln(size,' ',level);
//   readln;
   end;
END.