Given an array of distinct integers, find the largest subset where every pair of numbers is compatible in a division sense — for any two numbers in the subset, the larger one is evenly divisible by the smaller one. Sorting the numbers first turns this into a subsequence problem: once ascending, any valid subset lines up in that same increasing order, because a bigger multiple can only be evenly divisible by a smaller factor that came before it. That makes it possible to ask, for every number, "what's the best divisible chain that ends here?" — check every earlier, smaller number, and whenever it evenly divides the current one, the chain ending there could be extended. Solving that sub-problem once per number, in ascending order, and remembering which earlier number produced each best chain, is enough to reconstruct the whole thing afterward.