
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
Given a positive integer \( n \geq 3 \), and \( n \) points \( A_{1}, A_{2}, \cdots, A_{n} \) on a plane, where no three points are collinear, let \( \alpha \) represent the minimum value of all angles \( \angle A_{i} A_{j} A_{k} \) (for \( i, j, k = 1, 2, \ldots, n \), and \( i, j, k \) are pairwise distinct). Determine the maximum value of \( \alpha \), and the arrangement of \( A_{1}, A_{2}, \cdots, A_{n} \) that achieves this maximum value.

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