Question 58
Find all pairs of positive integers $(m, n)$ for which it is possible to paint each unit square of an $m \times n$ chessboard either white or black in such a way that, for any unit square of the board, the number of unit squares which are painted the same color as that square and which have at least one common vertex with it (including the square itself) is even.