MathNet 2012 Question 34

$k$ pawns stand in some $k$ cells of an $n \times n$ table, $n \ge 2$, (exactly one pawn stands in each cell of these $k$ cells) so that each $2 \times 2$ square contains exactly $2$ pawns.
Determine all possible values of $k$.