#include<iostream.h>
#include<fstream.h>

long v[100001],x[1000000];
long n;
int verificare(long x){
  int i;   
     for(i=1;i<=n;i++) if(v[i]==x) return 1;
      return 0;
  }    

int main(){
 int t;
 long i,j,max,p,res=0;
 int prim[9]={0,1,2,3,5,7,9,11,13},u;
ifstream f("pairs.in");
ofstream g("pairs.out");
  f>>n;
  max=-1;
  for(i=1;i<=n;i++){   f>>v[i];
                       if(v[i]>max) max=v[i];          
		   }
  for(i=1;i<=max;i++){
       for(j=1;j<=(max/i)*i;j++){
            if(verificare(i*j)) x[i]++;
        }
   }
   
  for(i=2;i<=max;i++){
     p=i;
     if(x[p]){
         t=0;
          for(u=2;u<=8;u++) if(p%prim[u]==0){ p/=prim[u]; t++;}
            if(p==1) { if(t%2==0) res-=x[i];
                       else res+=x[i];
                     }      
        }
   }        
                          
   
 
cout<<n*(n-1)/2 - res;
f.close();
g.close();
return 0;
}