arsa

program primoriel;
uses WinCrt;
var
 n , p : Integer;

 Function premier(n: Integer) : boolean;
    var
     a: Integer;
     tf : Boolean;
    begin
     a:=0;
     repeat
        a:=a+1;
     until ((n mod a = 0) and (a <>1) ) or (a = n div 2+1 ) ;
     if a <> n div 2+1 then
      tf := False
     Else
      tf := True;

     premier := tf ;
    end;

    Procedure primoriiel(n : integer);
     var
      a,b,c,d : Integer;
     begin
      a:=1;
        b:=1;
      repeat
            a:=a+1;
          if Premier(a) = True then
                b:=b*a;
                writeln(b,'  ',a);
        Until (b= n-1) or (b >= n );

        if b = n-1 then
         writeln('premier primoriel ',n,'= ',b,'# +1 ')
        Else
         If b = n +1 then
            writeln('premier primoriel ',n,'= ',b,'# -1 ')
         Else
           writeln('premier ama mahouch primoriel ');
     end;











Begin
 write('N : ');
  Readln(n);

writeln(premier(n));
if premier(n) = true then
 primoriiel(n)
Else
 write('lahou la primoriel la premier ');

End.