Program Ciurul;
               uses crt;
               var i, j : longint;
                   a : array[1..200000] of longint;
                   n, nr : longint;
begin clrscr;
             Write('N='); readln(n);
             Write('Numerele prime sunt:');
             writeln;
             for i:=2 to n do begin
                                   if a[i]=0 then begin
                                                     write(i,' ');
                                                     NR:=NR+1;
              for j:=2 to n do begin
                                   if i*j>n then break else a[i*j]:=1;
                               end;
                     end;
             end;
readln;
end.