HMMT November 2021 H9

Let $n$ be the answer to this problem. Find the minimum number of colors needed to color the divisors of $(n-24)$ ! such that no two distinct divisors $s, t$ of the same color satisfy $s \mid t$.