#include<fstream.h>
long n,m[100001];

int prim(int x,int y)
{int r;
while(y!=0){r=x%y;r=x;x=y;}
return x;
}
int main()
{ifstream f("pairs.in");
int i,j,nr=0;
f>>n;for(i=1;i<n+1;i=i+1)f>>m[i];
f.close();
ofstream g("pairs.out");
for(i=1;i<n;i=i+1)
 for(j=i;j<n+1;j=j+1)
if(prim(m[i],m[j])==1) nr++;
g<<nr;
g.close();
return 0;}