Find the smallest integer $n$ such that any subset of $\{1, 2, \ldots, 100\}$ with $n$ elements contains at least two elements whose difference is 9.

Let's think step by step and output the final answer within \boxed{}.
user