#include<iostream.h>
#include<fstream.h>
#define NN 100000


int divizori(long x, long y)

{int ok=1;  long d;
 if (x%y==0 || y%x==0) return 0;
 else
 if (x<y)
       {	d=2;
		while (d<=x/2 && ok)
		  {if (x%d==0 && y%d==0) ok=0;  d++;}
       }
   else
	  { d=2;
	  while (d<=y/2 && ok)
	   {if (x%d==0 && y%d==0) ok=0; d++;}
	}
   return ok;


}

long a[ NN ];
int main()
{ long i,j,n,s=0;
  fstream f("pairs.in",ios::in);
  fstream g("pairs.out",ios::out);
  f>>n;
  for (i=1;i<=n;++i)
     f>>a[i];

  for (i=1;i<=n-1;++i)
    for (j=i+1;j<=n;++j)
	if (a[i]%2==0 && a[j]%2==1 ||a[i]%2==1 && a[j]%2==0 ||a[i]%2==1 && a[j]%2==1)
	{
	s=s+divizori(a[i],a[j]);     }

 g<<s;
 g.close();
 return 0;
}