Let there be 2004 be bicolor tiles, white on one side and black on the other, placed in a circle. A move consists of choosing a black piece and turning over three pieces: the chosen one, the one on its left and the one on its right. If at the beginning there is only one black piece, will it be possible, repeating the movement described, to make all the pieces have the white face up? combinatoricsgameColoring