27задача_комба

def factorial(n:int) -> int:
    ans = 1
    for i in range(2,n+1):
        ans *= i
    return ans

def cnk(n:int,k:int) -> int:
    ans = 1
    for i in range(n-k):
        ans *= n - i
    return ans // factorial(k)

#print(cnk(5,2))

N = int(input())
data = [0] * 12
ans = 0

for i in range(N):
    k = int(input())
    data[k%12] += 1

for i in range(len(data)):
    for j in range(i,len(data)):
        for k in range(j,len(data)):
            if i != k and j != k and i != j:
                if (i + k + j) % 12 == 0:
                    ans += data[i] * data[j] * data[k]
            elif i == j and i != k:
                if (i + j) % 12 == 0:
                    ans += data[k] * cnk(data[i],2)
            elif j == k and i != j:
                if (j+k) % 12 == 0:
                    ans += data[i] * cnk(data[j],2)
            elif i == j and i == k:
                if (i+k+j) % 12 == 0:
                    ans += cnk(data[i],3)
print(ans)