IMO Shortlist 2014 problem C3
Let be an integer. Consider an chessboard divided into unit squares. We call a configutaion of rooks on this board happy if every row and every column contains exactly one rook. Find the gretest positive integer such that for every happy configuration of rooks, we can find a square without a rook on any of its unit squares.