var f,g:text;
   v:array[1..10000] of longint;
   m,n,i,j,k:integer;
   q:boolean;
function prim(a,b:longint):boolean;
var l:longint;p:boolean;
begin
prim:=true;
if (a mod b=0) or (b mod a=0) then prim:=false
else
begin
if a>b then
     for l:=2 to a div 2 do
                  if (a mod l=0) and (b mod l=0)then prim:=false;
if a<b then
for l:=2 to b div 2 do
                  if (a mod l=0) and (b mod l=0)then prim:=false;
if a=b then prim:=false;
end;
end;
begin
assign(f,'pairs.in');
reset(f);
readln(f,n);
for i:=1 to n do
readln(f,v[i]);
close(f);
k:=0;
for i:=1 to n-1 do
for j:=i+1 to n do
begin
q:=prim(v[i],v[j]);
if q then inc(k);
end;
assign(g,'pairs.out');
rewrite(g);
writeln(g,k);close(g);
end.