Const
 N=40;
Var
 A:Array[1..N] of Byte;
 i,Nn:Byte;

Function Prime(p:byte):Boolean;
var b:boolean; m:byte;
begin
 b:=false;
 If p>3 then
  begin
   m:=(p div 2)+1;
   Repeat
    Dec(m);
    If (p mod m)=0 then b:=true;
   Until b or (m=2);
  end;
 Prime:=Not(b);
end;

Begin
 Randomize;
 Nn:=0;
 For i:=1 to N do
  begin
   A[i]:=Random(99)+1;
   Write(A[i]:4);
  end;
 Writeln;
 Writeln;
 For i:=1 to (N div 2) do
  begin
   If Prime(A[2*i]) and ((A[2*i-1] mod 2)=0) then
    begin
     Inc(Nn);
     Writeln('A[',(2*i-1):2,']=',A[2*i-1]:2,' - even,    A[',2*i:2,']=',A[2*i]:2,' - prime');
    end;
   If (2*i<N) and Prime(A[2*i]) and ((A[2*i+1] mod 2)=0) then
    begin
     Inc(Nn);
     Writeln('A[',2*i:2,']=',A[2*i]:2,' - prime,   A[',(2*i+1):2,']=',A[2*i+1]:2,' - even');
    end;
  end;
 Writeln;
 Writeln(Nn,' pairs');
 Readln;
End.

VAR
 A:Array[1..200] of LongInt;
 Nmin,Nmax,k,n1,n2:LongInt;
 N,i,j:Byte;
BEGIN
 REPEAT
  N:=0;
  Write('Nmin= ');
  Readln(Nmin);
  Write('Nmax= ');
  Readln(Nmax);
  k:=Nmin-1;
  Repeat
   Inc(k);
   n1:=(k div 100000)+((k mod 100000) div 10000)+((k mod 10000) div 1000);
   n2:=((k mod 1000) div 100)+((k mod 100) div 10)+(k mod 10);
   If n1=n2 then
    Begin
     Inc(N);
     If N>200 then
      Writeln('Too wide range! Narrow it!')
     else
      begin
       A[N]:=k;
      end;
    End;
  Until (N>200) or (k=Nmax);
 UNTIL N<=200;
 For i:=1 to 20 do
  For j:=1 to 10 do
   begin
    k:=(i-1)*10+j;
    if k<=N then write(A[k]:8);
   end;
 Writeln;
 Writeln('N= ',N);
 Readln;
END.