输入一个正整数n,将n分解成质因数幂的乘积形式.

var n,a,b,c,d,k,l:longint;
f,t,j:boolean;
begin
write('n=');readln(n);
a:=1;
b:=n;
t:=false;
j:=false;
repeat
f:=true;
c:=-1;
for d:=2 to a-1 do if a mod d=0 then f:=false;
if f then
repeat
c:=c+1;
k:=1;
for l:=1 to c do k:=k*a;
if k=n then begin
write(n,'=',a,'(',c,')');t:=true;j:=true;break;
end;
until c>1000;
a:=a+1;
until t or (a>n);
if not(j) then writeln('Not!');
readln;
end.