#include<stdio.h>
#define NN 100000

long a[ NN ];
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;


}


int main()
{ long i,j,n,s=0;


  freopen("pairs.in", "rt", stdin);   
  freopen("pairs.out", "wt", stdout);   
  
    scanf("%lld", &n);   
    for (i = 1; i <= n; i ++){   
        scanf("%d", &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]);     }

 printf("%d\n",s);  ;
 
 return 0;
}