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.