def gcd(x, y):
	if y == 0:
		return x
	return gcd(y, x % y)

N = int(input())
A = [ int(input()) for i in range(N) ]
ans = 0
for i in range(N):
	for j in range(i):
		for k in range(j):
			if gcd(gcd(A[i], A[j]), A[k]) == 1:
				ans += 1
print(ans)