
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 2006-sided polygon. A diagonal of \( P \) is called a "good edge" if its endpoints divide the polygon into two parts, each containing an odd number of the polygon's sides. Each side of \( P \) is also considered a "good edge".

Given that 2003 non-intersecting diagonals divide \( P \) into several triangles, determine the maximum number of isosceles triangles, under this division, that have two "good edges".

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