
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$-gon $S-A_{1} A_{2} \cdots A_{n}$ has its vertices colored such that each vertex is colored with one color, and the endpoints of each edge are colored differently. Given $n+1$ colors available, find the number of different ways to color the vertices. (For $n=4$, this was a problem in the 1995 National High School Competition)

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