#最大公約数
def gcd(a,b):
  if b == 0: return a
  return gcd(b, a % b)

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):
      g = gcd(A[i],A[j])
      g = gcd(g,A[k])

      if g == 1:
        ans += 1

print(ans)