Question 139
In each cell of a chessboard (of size $8 \times 8$) a rook is placed. At each step one can remove from the board one rook which beats an odd number of other rooks (for example, in the initial configuration the top-left rook beats $2$ rooks). Find the maximal possible number of rooks one can remove from the board.