Rita and Sam play the following game with n sticks on a table. Each must remove 1, 2, 3, 4, or 5 sticks at a time on alternate turns, and no stick that is removed is put back on the table. The one who removes the last stick (or sticks) from the table wins. If Rita goes first, which of the following is a value of n such that Sam can always win no matter how Rita plays?

A. 7
B. 10
C. 11
D. 12
E. 16

[spoiler]OA=D[/spoiler]

Source: Official Guide