Question 104
A square is dissected into $n^2 \ge 4$ rectangles by $n-1$ vertical lines and $n-1$ horizontal lines. Prove that one may choose $2n$ of these rectangles such that for any two of the chosen rectangles, one can be put completely into the other (perhaps, after some rotation).