#include <fstream>
using namespace std;

ifstream fin("pairs.in");
ofstream fout("pairs.out");
const int kMax = 1e5 + 5;
int n, v[kMax];

int gcd(int a, int b)
{
	while (b)
	{
		int r = a % b;
		a = b;
		b = r;
	}
	return a;
}

int main()
{
	fin >> n;
	for (int i = 1; i <= n; ++i)
		fin >> v[i];

	long long res = 0;
	for (int i = 1; i <= n - 1; ++i)
		for (int j = i + 1; j <= n; ++j)
			if (gcd(v[i], v[j]) == 1)
				++res;

	fout << res << '\n';
	return 0;
}