For which values of $n$ it is possible to cover the side wall of staircase of n steps (for $n = 6$ in the figure) with plates of shown shape? The width and height of each step is $1$ dm, the dimensions of plate are $2 \times 2$ dm and from the corner there is cut out a piece with dimensions $1\times 1$ dm.
Problem
Source: 1999 Estonia National Olympiad Final Round grade 11 p4
Tags: combinatorics, combinatorial geometry