Question 84
$n$ ($n \ge 3$) table tennis players have a round-robin tournament — each player will play all the others exactly once, and there is no draw game. Suppose, after the tournament, all the players can be arranged in a circle such that, for any three players $A$, $B$, $C$, if $A$, $B$ are adjacent, then at least one of them defeated $C$. Please find all possible values of $n$. (posed by Fu Yunhao)