BY-MO 2004 Problem 3

The cells of an $n\times n$ table ( $n\ge 3$ ) are painted black and white in the chess-like manner. Per move one can choose any $2\times 2$ square and reverse the color of the cells inside it. Find all $n$ for which one can obtain a table with all cells of the same color after finitely many such moves.