A student at Harvard named Kevin
Was counting his stones by $11$
He messed up $n$ times
And instead counted $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