#include<stdio.h>
long prim(long a,long b)
{long r=a%b;
 while(r) {a=b;
           b=r;
           r=a%b;}
 return b;
}
int main()
{long n,i,j,v[100001],r=0;
 FILE*f=fopen("pairs.in","r");
 FILE*g=fopen("pairs.out","w");
 fscanf(f,"%ld",&n);
 for(i=1;i<=n;i++)
	fscanf(f,"%ld",&v[i]);
 for(i=1;i<n;i++)
	for(j=i+1;j<=n;j++)
		if(prim(v[i],v[j])==1) r++;
 fprintf(g,"%ld",r);
 fcloseall();
 return 0;
}