program sum;
var i,n,j,m,x : 0..100000;
    S : longint;
    f,g : text;
function min(a,b:longint):longint;
begin
if a>b then min := b
        else min := a;
end;

function prim(x,y:longint):boolean;
var l : longint;
    ok : boolean;
begin
ok := true;

for l := 2 to min(x,y) do
if (x mod l = 0) and (y mod l = 0) then begin
                                ok := false;
                                break;
                                end;



prim := ok;

end;

begin
assign(f,'sum.in');
reset(f);

readln(f,n);
assign(g,'sum.out');
rewrite(g);

for i := 1 to n do begin
readln(f,x);
S := 1;
for j := 2 to (2*x) do
if prim(j,x) then S := S+j;


writeln(g,S);

end;



close(f);
close(g);

end.