program ERATOST2 { Sieve of Eratosthenes } ;
const Max = 129685 ;
var J, K : longint ;
Prime : array [1..Max div 2] of boolean ;
BEGIN Writeln('ERATOSTHENES'^M^J'     2') ;
FillChar(Prime, SizeOf(Prime), true) ;
for J := 3 to Max do if Odd(J) then if Prime[J div 2] then begin
  Writeln(J:6) ;
  K := J ;
  repeat
    K := K+2*J ;
    if K>Max then BREAK ;
    Prime[K div 2] := false ;
    until false ;
  end ;
Write('<cr>') ; Readln ;
END.