MathNet 2015-part-01 — 191 problems (EN–VI) Question 176

João managed to paint the squares of an $n \times n$ board black and white in such a way that the intersections of any two rows and any two columns were not made up of squares of the same color. What is the maximum value of $n$?