#include <stdio.h>
int i, j, n, num, x[100100];
int primeintreele(int i, int j)
{
	int a = x[i], b = x[j], r;
	while (b)
		r = a % b, a = b, b = r;
	if (a == 1)
		return 1;
	return 0;
}
int main()
{
	freopen ("pairs.in", "rt", stdin);
	freopen ("pairs.out", "wt", stdout);

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

	for (i = 1; i < n; i ++)
		for (j = i + 1; j <= n; j ++)
		{
			if (primeintreele(i, j))
				num ++;
		}

	printf("%ld\n", num);

	return 0;
}