function prim(a:integer):integer;
var i:integer;
begin
for i:=1 to a do
if a mod i = 0 then
prim += 1;
end;
var
a:array of integer;
i,n:integer;
begin
read(n);
setlength(a,n);
writeln;
for i:=0 to n-1 do
read(a[i]);
writeln;
for i:=0 to n-1 do
if prim(a[i])=2 then
write(a[i],' ');
end.