Question 3
A football tournament has $4n$ teams, where $n$ is a positive integer. Each round divides all teams into $2n$ pairs, which play against each other. No two teams may play more than once. Find the least positive integer $a$ for which it is possible to arrange $a$ rounds so that every subsequent partition of the teams into $2n$ pairs includes at least one pair that has already played.