Question 147
A board $n \times n$ ($n \geq 3$) is divided into $n^{2}$ unit squares. Integers from $0$ to $n$ inclusive are written down: one integer in each unit square, in such a way that the sums of integers in each $2 \times 2$ square of the board are different. Find all $n$ for which such boards exist.