def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)
def gcd3(a, b, c):
    return gcd(gcd(a, b), c)

N = int(input())
A = [int(input()) for i 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 gcd3(A[i], A[j], A[k]) == 1:
                ans += 1
print(ans)