MathNet 1989 — Part 01 Question 39

Show that for each integer $n \gt 0$, there is a polygon with vertices at lattice points and all sides parallel to the axes, which can be dissected into $1 \times 2$ (and/or $2 \times 1$) rectangles in exactly $n$ ways.