Program suma_numaru_diviz;
 var a:array [1..100000000] of boolean;
   n,k,s,t:int64;
   i,j:longint;
   fi,fo:text;
begin
assign(fi,'ssnd.in');
 assign(fo,'ssnd.out');
reset(fi);
 rewrite(fo);
readln(fi,t);
  for i:=2 to 10000000 do
                if not a[i] then
                  for j:=2 to n div i do
                                     a[i*j]:=true;
for i:=1 to t do begin
 readln(fi,n);
  for j:=2 to n div 2 do
   if (a[j]=false) and (n mod j=0) then begin
                                          k:=(k+1) mod 9973;
                                          s:=(s+j) mod 9973;
                                          end;
  writeln(fo,k+2 mod 9973,' ',s+n+1 mod 9973);
 k:=0; s:=0;
end;
close(fo);
end.