#include <fstream>
using namespace std;
ifstream f("pairs.in");
ofstream g("pairs.out");
int prime(int a,int b)
{
	while (a!=b)
		if (a>b)
			a-=b;
		else
			b-=a;
	return a;
}
int main()
{
	int n,a[100],x,y,i,j,ct=0;
	f>>n;
	for (i=0;i<n;i++)
		f>>a[i];
	
	for (i=0;i<n-1;i++)
		for (j=i;j<n;j++)
			if (prime(a[i],a[j])==1)
				ct++;

	g<<ct;
}