The beaver is chess piece that move to $2$ cells by horizontal or vertical.  Every cell of $100 \times 100$ chessboard colored in some color,such that we can not get from one cell to another with same color with one move of beaver or knight. What minimal color do we need?