A circle is divided into $2n$ equal sectors, $n \in \mathbb{N}$. Vitya and Masha are playing the following game. At first, Vitya writes one number in every sector from the set $\{1,2,\ldots,n\}$ and every number is used exatly twice. After that Masha chooses $n$ consecutive sectors and writes $1$ in the first sector, $2$ in the second, $n$ in the last. Vitya wins if at least in one sector two equal number will be written, otherwise Masha wins. Find all $n$ for which Vitya can guarantee his win.