Question 4
A computer screen shows a $98\times98$ chessboard with the usual alternating colors. A mouse click selects any rectangle whose sides lie on board gridlines and switches every color inside it. Find, with proof, the minimum number of clicks needed to make the board all one color.