Question 161
Initially, the 9 squares of a $3 \times 3$ chessboard each contain a $0$. At each step, Pedro chooses two squares sharing a side, and either adds $1$ to both squares or adds $-1$ to both squares. Prove that it is impossible to reach, in a finite number of moves, the situation where all the squares are filled with a $2$.