def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        while n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

from random import randint
from collections import Counter

r = [randint(1, 1000000000000000000) for _ in range(1000000)]
n = int(input())
a = list(map(int, input().split()))
b = [0] * (n + 1)
for i in range(n):
    t = 0
    for pr in prime_factorize(a[i]):
        t ^= r[pr]
    b[i + 1] = b[i] ^ t
ans = 0
for v in Counter(b).values():
    ans += v * (v - 1) // 2
print(ans)