This problem involves two main steps. First is to find all the distinct divisors for the given number n. Second step is to use the least common multiple algorithm on all possible pairs of divisors, keeping a tally of each time we find a pair whose least common multiple is the original number n. From there, the problem is pretty straight forward.