var i,n,x:longint;
    s:qword;
    f,g:text;
procedure prim;
var r,i,xx,nr:longint;
begin
s:=1;
if x mod 2=0 then begin
                  i:=3;
                  while i<2*x do begin
                                 nr:=i;
                                 xx:=x;
                                 while xx<>0 do begin
                                                r:=nr mod xx;
                                                nr:=xx;
                                                xx:=r;
                                                end;
                                 if nr=1 then s:=s+i;
                                 i:=i+2;
                                 end;
                    end
else begin
for i:=2 to 2*x-1 do begin
                   nr:=i;
                   xx:=x;
                   while xx<>0 do begin
                                  r:=nr mod xx;
                                  nr:=xx;
                                  xx:=r;
                                  end;
                   if nr=1 then s:=s+i;
                   end;
end;
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);
                 prim;
                 writeln(g,s);
                 end;
close(f);
close(g);
end.