Question 128
At a round table are seated $n$ boys and $n$ girls, where $n \gt 3$. In every move, it is allowed to swap the sitting places of two adjacent children. The entropy of a sitting arrangement is the minimum number of moves resulting with each child having at least one neighbor of the same gender. Find the maximum possible entropy of a sitting arrangement.