#include <fstream.h>
#include<math.h>
 long n,v[100000];
long prim(int a,int b)
{ int c,d,ok;
if(a>b) c=b;
 else c=a; d=2;
 ok=1;
 while(c!=1){

 while(c%d==0)c=c/d;
 if(a%d==0&&b%d==0)ok=0;
 d++;  }
 if(ok)return 1;
 else return 0;}




int main()
{ ifstream f("pairs.in");
  ofstream g("pairs.out");
  long  nr=0,i,j;
f>>n;
for (i=1;i<=n;i++) f>>v[i];
f.close();

for (i=1;i<=n-1;i++)
for (j=i+1;j<=n;j++) if(prim (v[i],v[j])==1)nr++;
g<<nr;
g.close();return 0;}