Question 4
Let $n$ be a positive integer. Find the smallest positive integer $k$ such that, for every colouring of the squares of a $2n\times k$ chessboard with $n$ colours, there are two columns and two rows whose four intersection squares have the same colour.