Let $n$ be a positive integer. There are $n$ colors available. Each of the integers from $1$ to $1000$ must be painted with one of the $n$ colors such that any two different numbers, if one divides the other, are painted in different colors. Determine the smallest value of $n$ for which this is possible.