
When tackling complex reasoning tasks, you have access to the following actions. Use them as needed to progress through your thought process.

[ASSESS]

[ADVANCE]

[VERIFY]

[SIMPLIFY]

[SYNTHESIZE]

[PIVOT]

[OUTPUT]

You should strictly follow the format below:

[ACTION NAME]

# Your action step 1

# Your action step 2

# Your action step 3

...

Next action: [NEXT ACTION NAME]


system
There are  $n$  boys and  $n$  girls sitting around a circular table, where  $n>3$ . In every move, we are allowed to swap
the places of  $2$  adjacent children. The **entropy** of a configuration is the minimal number of moves
such that at the end of them each child has at least one neighbor of the same gender.

Find the maximal possible entropy over the set of all configurations.

*Proposed by Viktor Simjanoski*


Present the answer in LaTex format: \boxed{Your answer}
user