#include <fstream>
using namespace std;
ifstream f("pairs.in");
ofstream g("pairs.out");
int prim(int x,int y)
{while(x!=y)
 if(x>y)
 x=x-y;
 else
 y=y-x;
 if(x==1) return 1;
 else return 0;
}
int main()
{int v[100000],N,r=0,k,i,j;
 f>>N;
 for(i=1;i<=N;i++)
 {f>>v[i];
 }
 for(i=1;i<=N;i++)
 {for(j=1;j<=N;j++)
 {k=prim(v[i],v[j]);
  if(v[i]!=v[j]&&k==1) r+=1;
 }
 }
 g<<r;
 f.close();
 g.close();
}