def solution(l):
    count = 0
    for i in range(0, len(l)):
        for j in range(i+1, len(l)):
            if l[j] % l[i] == 0:
                for k in range(j+1, len(l)):
                    if l[k] % l[j] == 0:
                        count += 1
    return count