#include<stdio.h>
#include<math.h>
FILE *f=fopen("pairs.in","r");
FILE *g=fopen("pairs.out","w");
long n,m[100000],nrsol;

int prim(long x)
{
  if(x==2)
   return 1;
   else if(x%2==0)
    return 0;
  for(long i=3;i<=sqrt(x);i+=2)
   if(x%i==0)
     return 0;
 return 1;

}


void cit()
{

  fscanf(f,"%ld",&n);
  for(long i=1;i<=n;i++)
   fscanf(f,"%ld",&m[i]);
}



int nrprime(long x,long y)
{
  long r;
  r=x%y;
  while(r!=0)
  {x=y;
  y=r;
  r=x%y;
  }

 if(y==1)
 return 1;
 return 0;

}



void solve()
{
  nrsol=0;
  for(long i=1;i<n;i++)
   {
    if(prim(m[i]))
      {for(long j=i+1;j<=n;j++)
       if(m[j]%m[i]!=0)
	nrsol++;
      }
     else for(long j=i+1;j<=n;j++)
	   if(nrprime(m[i],m[j]))
	    nrsol++;
  }

}

int main()
{

cit();
solve();
fprintf(g,"%ld",nrsol);

fcloseall();
return 0;
}