PL-OM 2000 Problem 5

In the unit squre For the given natural number $n \geq 2$ find the smallest number $k$ that from each set of $k$ unit squares of the $n$ x $n$ chessboard one can achoose a subset such that the number of the unit squares contained in this subset an lying in a row or column of the chessboard is even