
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 is a stack of $n$ cards labeled from top to bottom as $1, 2, \cdots, n$. Each time, you can take a small stack of these cards (which can be just one card), and without disturbing their order, insert them into any position in the original stack (between any two cards, on top of the first card, or below the $n$-th card). Such an operation is called a "move." What is the minimum number of moves required to completely reverse the order of this stack of cards, i.e., the $n$ cards are labeled from top to bottom as $n, n-1, \cdots, 2, 1$?

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