#include <stdio.h>

int n,v[100001],k;
int r;


int euclid (int a,int b)
{
	if ( b >a )
		a = a ^ b ^( b= a);
	while(b)
		a = b + a% b - (b = a % b) ; 
	
	return a;
	
}

int prim(int a,int b)
{
	r = euclid (a,b);
	if (r == 1)
		return 1;
	else
		return 0;
	
	
}

int main ()
{
	int i,j;
	freopen("pairs.in","r",stdin);
	scanf("%d",&n);
	for (i = 1;i <= n; ++i)
		scanf("%d",&v[i]);
	
	for (i = 1;i < n; ++i)
		for (j = i+1; j <= n; ++j)
			if (prim(v[i],v[j]))
				k++;
	freopen("pairs.out","w",stdout);
	printf("%d",k);
	
	
	return 0;
}