In a table $n\times n$ some unit squares are coloured black and the other unit squares are coloured white. For each pair of columns and each pair of rows the four squares on the intersections of these rows and columns must not all be of the same colour. What is the largest possible value of $n$?