function find(x:longint):longint;

var i:longint;

begin

find:=0;

for i:=2 to trunc(sqrt(x)) do

if n mod i=0 then begin find:=1; break; end;

end;

begin

readln(n);

for i:=2 to trunc(sqrt(n)) do

if (n mod i=0) and (find(i)=0) then break;

write(n div i);

end.