Let $n$ be a positive integer such that $n \geq 3$. Consider a grid with size $n \times n$ where each square can be white or black, in the beginning they are all white. In every step we can change the colors of cells forming a shape like below or any of its rotations. Determine all $n$ such that the whole grid can be black after a finite number of steps.