
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
A *$n$ -trønder walk* is a walk starting at  $(0, 0)$ , ending at  $(2n, 0)$  with no self intersection and not leaving the first quadrant, where every step is one of the vectors  $(1, 1)$ ,  $(1, -1)$  or  $(-1, 1)$ . Find the number of  $n$ -trønder walks.

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