MathNet 2017-part-02 — 176 problems (EN–VI) Question 156

For which $n \geqslant 1$ can an $n \times n$ chessboard be filled with pieces of the shape

without overlapping? (Rotations are allowed.)