#include <fstream.h>
int prim(int p,int q)
{
	while (p!=q)
	{
		if (p>q)
			p-=q;
		else
			q-=p;
	}
	if (p==1)
		return 1;
        return 0;
}
int main()
{
	long i,j,n,v[1000],k=0;
	ifstream f("pairs.in");
	ofstream g("pairs.out");
	f>>n;
	for (i=1;i<=n;i++)
		f>>v[i];
	for (i=1;i<=n-1;i++)
		for (j=i+1;j<=n;j++)
			if (v[i]!=v[j] && prim(v[i],v[j]))
                        	k++;    	
	g<<k;
	f.close();
	g.close();
	return 0;
}