N=int(input())

def gcd3(a,b,c):
    if b>a:
        a,b=b,a
    while a%b!=0:
        a,b=b,a%b
    if c>b:
        b,c=c,b
    while b%c!=0:
        b,c=c,b%c
    return c

L=[]
for i in range(N):
    n=int(input())
    L.append(n)
ans=0
for i in range(N):
    for j in range(i+1,N):
        for k in range(j+1,N):
            if gcd3(L[i],L[j],L[k])==1:
                ans+=1
print(ans)