#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;

int s[610];

int gcd(int a, int b) {
	if (a < b) swap(a, b);
	while (b) {
		int t = a % b;
		a = b;
		b = t;
	}
	return a;
}

int main() {
	int n;
	while (cin >> n) {
		memset(s, 0, sizeof s);
		for (int i = 0; i < n; i ++ ) cin >> s[i];
		int cnt = 0;
		for (int i = 0; i < n; i ++ ) {
			for (int j = i + 1; j < n; j ++ ) {
				if (gcd(s[i], s[j]) == 1) cnt ++;
			}
		}
		cout << cnt << endl;
	}
	return 0;				
}