Question 96
A finite grid is covered with $1 \times 2$ cards in such a way that the edges of the cards match with the lines of the grid, no card lies over the edge of the grid, and every square is covered by exactly two cards. Prove that one can remove some of the cards in such a way that every square will be covered by exactly one card.