def gcd(a, b):
    while b:
        a, b = b, a%b
    return a
    
n = int(input())
a = [int(input()) for _ in range(n)]
ans = 0

for i in range(n):
    for j in range(i+1, n):
        for k in range(j+1, n):
            if gcd(gcd(a[i], a[j]), a[k])==1:
                ans += 1

print(ans)