def solution(l):
	divs = [0]*len(l)
	tups = 0
	for i in range(len(l)):
		for j in range(i):
			if l[i] % l[j] == 0:
				divs[i] += 1
				tups += divs[j]

	return tups