program divizori;
var t:integer;
    i,j:longint;
    n,nr,s:qword;
    f,g:text;
begin
assign(f,'ssnd.in');reset(f);
assign(g,'ssnd.out');rewrite(g);
readln(f,t);
for j:=1 to t do begin
                 s:=0;
                 nr:=0;
                 readln(f,n);
                 for i:=1 to n div 2 do if n mod i=0 then begin
                                                          inc(nr);
                                                          s:=s+i;
                                                          end;
                 writeln(g,nr+1,' ',s+n);
                 end;

close(f);close(g);
end.