program FindPrimeNumbers;
varcount, num, i, j: integer;isPrime: boolean;
begincount := 0;num := 101;
while count < 10 dobeginisPrime := true;
end;end.
program FindPrimeNumbers;
var
count, num, i, j: integer;
isPrime: boolean;
begin
count := 0;
num := 101;
while count < 10 do
for i := 2 to num div 2 dobegin
isPrime := true;
begin
if num mod i = 0 then
begin
isPrime := false;
break;
end;
end;
if isPrime then
begin
writeln(num);
count := count + 1;
end;
num := num + 1;
end;
end.