var n:longint;
  m:array [1..100000] of longint;
  fin,fout:text;

 procedure citire;
  var i:longint;
  begin
   readln(fin,n);
   for i:=1 to n do readln(fin,m[i]);
  end;

 function prime(a,b:longint):boolean;
  var r:longint;
  begin
   r:=1;
   while r<>0 do
     begin
     r:=a mod b;
     a:=b;
     b:=r;
     end;
   if a=1 then prime:=true
   else prime:=false;
  end;

 procedure perechi;
  var i,j,p:longint;
  begin
   p:=0;
   for i:=1 to n do
     for j:=i+1 to n do
       if prime(m[i],m[j]) then p:=p+1;
   write(fout,p);
  end;

begin
  assign(fin,'pairs.in');
  assign(fout,'pairs.out');
  reset(fin);
  rewrite(fout);
  citire;
  perechi;
  close(fin);
  close(fout);
end.