
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
Consider the permutation of $1, 2, \cdots, 20$ as $\left(a_{1} a_{2} \cdots a_{20}\right)$. Perform the following operation on this permutation: swap the positions of any two numbers. The goal is to transform this permutation into $(1, 2, \cdots, 20)$. Let $k_{a}$ denote the minimum number of operations needed to reach the goal for each permutation $a=\left(a_{1}, a_{2}, \cdots, \right.$, $\left.a_{20}\right)$. Find the maximum value of $k_{a}$.

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