Question 43
A board of size $1000 \times 1000$ is given. Is it possible to colour exactly $125$ unit squares of the board in such a way that every coloured unit square has an odd number of coloured neighbouring unit squares? Two unit squares are neighbouring if they have a common side.