
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
In a convex decagon \(A_{1} A_{2} \ldots A_{10}\), all the sides as well as all the diagonals connecting vertices at intervals of one (i.e., \(A_{1} A_{3}, A_{2} A_{4},\) etc.) are drawn, except the side \(A_{1} A_{10}\) and diagonals \(A_{1} A_{9}, A_{2} A_{10}\).

A path leading from \(A_{1}\) to \(A_{10}\) is defined as a non-self-intersecting broken line (i.e., one where non-adjacent segments do not share points) with endpoints \(A_{1}\) and \(A_{10}\). Each segment of this path coincides with one of the drawn sides or diagonals. Find the number of such paths.

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