from math import gcd
N=int(input())
A=[0]*N

for i in range(N):
    A[i]=int(input())

S=set()
for i in range(N):
    for j in range(i+1,N):
        for k in range(j+1,N):
            x,y,z=A[i],A[j],A[k]
            p,r=min(x,y,z),max(x,y,z)
            q=x+y+z-(p+r)
            if gcd(gcd(p,q),r)==1:
                S.add((p,q,r))
print(len(S))