from functools import reduce
from math import gcd
from itertools import combinations

def f(a):
    return reduce(gcd, a)

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

C = 0
for i in combinations(A, 3):
    if f(i) == 1:
        C += 1

print(C)