There are $110$ guinea pigs for each of the $110$ species, arranged in a $110 \times 110$ array. Find the maximum integer $n$ such that, no matter how the guinea pigs are arranged, we can always find a column or a row of $110$ guinea pigs containing at least $n$ different species.

Let's think step by step and output the final answer within \boxed{}.
user