[SGU]113. Nearly prime numbers

var
n,i,j,k,t,p:longint;

begin
read(n);
for i:=1 to n do
begin
read(k);
t:=k;
p:=0;
for j:=2 to trunc(sqrt(k)+0.5) do
while t mod j=0 do
begin
t:=t div j;
inc(p);
end;
if t>1 then
inc(p);
if p=2 then
writeln('Yes')
else
writeln('No');
end;
end.