Красив тот, кто красиво поступает.
Procedure factorize(n: longint);
var divisor: longint;
begin
divisor := 2;
while divisor * divisor <= n do
if n mod divisor = 0 then
begin
n := n div divisor;
writeln(divisor);
end
else inc(divisor);
if n <> 1 then writeln(n);
end;
var n: longint;
begin
readln(n);
factorize(n);
end.
program z1;
var
i,k:integer;
begin
k:=0;
i:=0;
while i <> 10 do begin
dec (k);
if (abs (k) mod 2 =1 ) and (k < 0) then
begin
writeln (k);
inc (i);
end;
end;
end.