program sum;
var i,n,j,m,x : 0..100000;
    S : longint;
    f,g : text;
function prim(x,y:longint):boolean;
var l,k : integer;
    ok : boolean;
begin
ok := true;
if x=y then ok := false
else
if x>y then
       for l := 2 to y do
       if x mod l=0 then if y mod l=0 then begin
       ok := false;
       break;
       end
else
for k := 2 to x do
       if y mod k=0 then if x mod k=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 write(j,' ');

readln;

writeln(g,S);

end;



close(f);
close(g);

end.