FNST

uses crt;
var
        snt: array [1..15] of Longword;
        save: real;
        tich,i,j,count,m:Longword   ;
function F(x:longword):real;
var
k:byte;
begin
f:=1;
for k:=1 to x do f:=f*snt[k];
end;
function ktsnt(x:Longword):boolean;
var
k:Longword;
begin
ktsnt:=true;
if x<2 then ktsnt:=false else
if x=2 then ktsnt:=true else
for k:=2 to trunc(sqrt(x)) do
        if  (x mod k = 0) then ktsnt:=false;
end;

begin
clrscr;
j:=0;
readln(m);
for i:=m downto 1 do
if ktsnt(i) then break;
writeln(i);
for i:=1 to 30 do
                if ktsnt(i) then begin inc(j);snt[j]:=i; end;
for i:=1 to 8 do
        for j:=1 to 8 do
        begin
        save:=F(i)*F(j);
        if save = m then begin write(snt[i+1],' ',snt[j+1]); exit; end;
        end;
readln;
end.