Olympiad Number Theory · Superchallenge problem

Let $D$ be the set of positive divisors of $120$. What is the largest possible size of a subset $S \subseteq D$ in which no element divides another?