
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
Let \( P \) be a regular polygon with 2006 sides. A diagonal of \( P \) is called good if its endpoints divide the perimeter of \( P \) into two parts, each having an odd number of sides of \( P \). The sides of \( P \) are also called good. Suppose \( P \) has been subdivided into triangles by 2003 diagonals that do not intersect at an interior point of \( P \). Find the maximum number of isosceles triangles that can appear in such a subdivision, where two sides of the isosceles triangles are good.

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