MathDB

Let

n

be a positive integer. We are given a

3n \times 3n

board whose unit squares are colored in black and white in such way that starting with the top left square, every third diagonal is colored in black and the rest of the board is in white. In one move, one can take a

2 \times 2

square and change the color of all its squares in such way that white squares become orange, orange ones become black and black ones become white. Find all

n

for which, using a finite number of moves, we can make all the squares which were initially black white, and all squares which were initially white black.
Proposed by Boris Stanković and Marko Dimitrić, Bosnia and Herzegovina

Problem Statement