function isPrime(num: integer): boolean;
var i:integer;
begin
   isPrime := true;
   
   for i := 2 to (num div 2) do
      if (num mod i = 0) then
      begin
         isPrime := false;
         exit
      end;  
end;

var n,j: integer;

begin
   n := 10000;
   for j := 2 to n do
   begin
      if isPrime(j) then
         write(j,' ');
   end;
   readln;
end.