
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 restricted path of length \( n \) is a path of length \( n \) such that for all \( i \) between 1 and \( n-2 \) inclusive, if the \( i \)th step is upward, the \( i+1 \)th step must be rightward.
Find the number of restricted paths that start at \( (0,0) \) and end at \( (7,3) \).

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