#include <fstream.h>
int i,j,m,x;
long n,v[1000],k;
int main()
{ifstream f("pairs.in");
ofstream g("pairs.out");
f>>n;
for (i=0;i<n;i++)
f>>v[i];
for (i=0;i<n-1;i++)
for (j=i+1;j<n;j++)
{x=0;
if (v[i]>v[j])
  {for (k=2;k<=v[j]/2;k++)
  if (v[i]%k==0 && v[j]%k==0) x=1;}
if (v[i]<v[j])
  {for (k=2;k<=v[i]/2;k++)
  if (v[i]%k==0 && v[j]%k==0) x=1;}
if (v[i]==2)
if (v[j]%2==0) x=1;
if (v[i]==3)
if (v[j]%3==0) x=1;
if (v[j]==2)
if (v[i]%2==0) x=1;
if (v[j]==3)
if (v[i]%3==0) x=1;


if (x==0) m++;}
g<<m;
f.close();
g.close();
return 0;}