def gcd(a,b):
    while b>0:
        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):
        t=gcd(a[i],a[j])
        for k in range(j+1,n):
            ans+=gcd(t,a[k])==1
print(ans)