Question 3
In an $n\times n$ grid, you are allowed to choose $k$ squares, including the top right and bottom left squares, and colour them red. The remaining squares are coloured blue. Thereafter, you are allowed to repeatedly choose any row or column and reverse the colours of all the squares in the row or column, respectively, until all the squares are red. What is the minimum value of $k$ for this to be possible?