#include <stdio.h>

#define ll long long
#define maxn 100010
#define maxp 168
#define maxx 1000010

ll sol;

int n,l,x,y,rez;
int a[maxn];
int p[maxp]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997};
int c[maxx];
int v[maxp],u[maxp];

void back(int k)
{
	if (k>l) c[x]++;
	else {
		 	back(k+1);
			x*=v[k];
			back(k+1);
			x/=v[k];
		 }
}

void back2(int k)
{
	if (k>l)
	{
		if (y) rez-=c[x];
		else rez+=c[x];
	}
	else 	{
				back2(k+1);
				x*=v[k];
				y^=1;
				back2(k+1);
				y^=1;
				x/=v[k];
			}
}

void dcmp(int x)
{
	int j;
	l=0;
	for (j=0;j<maxp && p[j]*p[j]<=x;j++)
		if (x%p[j]==0)
		{
			v[++l]=p[j];
			while (x%p[j]==0) x/=p[j];
		}
	if (x>1) v[++l]=x;
}

int main()
{
	freopen("pairs.in","r",stdin);
	freopen("pairs.out","w",stdout);
	
	scanf("%d ",&n);

	int i;

	for (i=1;i<=n;i++) scanf("%d ",&a[i]);

	for (i=1;i<=n;i++)
	{
		dcmp(a[i]);
		x=1;
		back(1);
	}

	for (i=1;i<=n;i++)
	{
		dcmp(a[i]);
		x=1;
		rez=0;
		back2(1);
		sol+=rez;
	}

	printf("%lld\n",sol/2);

	return 0;
}