A student at Harvard named Kevin was counting his stones by $11$. He messed up $n$ times and instead counted by $9$s, and wound up at $2007$. How many values of $n$ could make this limerick true?

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