Question 101
A square board $6 \times 6$ is filled out with positive integer numbers (by one number in every cell). Each step, it is allowed to choose a square larger than $1 \times 1$ and increase by 1 all numbers in its cells. Is it always possible to reach, after several steps, a situation when all numbers on the board are divisible by 3?