#include<fstream>
#include<assert.h>

using namespace std;

#define max_n 1000100

ifstream f("pairs.in");
ofstream g("pairs.out");

int n , x , max_v , k , k1 , nr , ok , prod;
bool Fr[max_n] , V[max_n];
int Prim[100000];

void read(){
	
	f>>n;
	
	for( int i = 1 ; i <= n ; i++ ){
		f>>x; Fr[x] = 1;
		max_v = x > max_v ? x : max_v;
	}
	
}

int desc( int i , int& prod ){
	
	int nr = 0;
	
	prod = 1;
	
	for( int j = 0 ; j < k ; j++ ){
		if( i & (1<<j) ){
			nr++;
			prod *= Prim[j+1];
		}
	}
	
	return nr%2;
}

int main(){
	
	read();
	
	int i , j;
	
	for( i = 2 ; i <= max_v ; i++ ){
		if( V[i] == 0 ){
			Prim[++k] = i;ok = 1;
			for( j = i ; j <= max_v ; j += i ){
				V[j] = 1;
				if( Fr[j] )
					ok = 0;
			}
			if(ok)
				k--;
		}
	}
	
	long long total = (n-1)*n/2;
	
	for( i = 1 ; i < (1<<k) ; i++ ){
		ok = desc(i , prod); nr = 0;
		
		for( j = prod ; j <= max_v ; j += prod ){
			if( Fr[j] )
				nr++;
		}
		
		if( ok )
			total -= (nr*(nr-1))/2;
		else
			total += (nr*(nr-1))/2;
	}
	
	g<<total;
	
	return 0;
}