#include <cstdio>

const int PMAX = 180;
const int P[] = {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, 1009};

unsigned int T[100000][6];
int L[100000];

int main(void) {
	FILE *fin = fopen("pairs.in" ,"rt");
	FILE *fout = fopen("pairs.out", "wt");
	int N;
	int i, j, k, c;
	int cnt = 0;
	bool ok;

	fscanf(fin, " %d", &N);

	for (i = 0; i < N; ++i) {
		fscanf(fin, " %d", &c);

		for (j = 0; j * j <= c; ++j)
			if (c % P[j] == 0) {
				while (c % P[j] == 0)  c /= P[j];
				T[i][j >> 5] |= 1u << (j & 31);
			}

		L[i] = c;

		for (j = 0; j < i; ++j) {
			ok = true;
			if (L[i] != 1 && L[i] == L[j]) ok = false;
			for (k = 0; k < 6 && ok; ++k)
				if (T[i][k] & T[j][k])
					ok = false;
			if (ok) ++cnt;
		}
	}

	fprintf(fout, "%d\n", cnt);

	fclose(fin);
	fclose(fout);
	return 0;
}