A parliament has n senators. The senators form 10 parties and 10 committees, such that any senator belongs to exactly one party and one committee. Find the least possible n for which it is possible to label the parties and the committees with numbers from 1 to 10, such that there are at least 11 senators for which the numbers of the corresponding party and committee are equal. combinatorics proposedcombinatorics