
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 2026 sides. A diagonal of \(P\) is said to be good if its endpoints divide the contour of \(P\) into two parts, each having an odd number of sides of \(P\). The sides of \(P\) are also said to be good. Suppose that \(P\) has been subdivided into triangles by 2023 diagonals, no two of which share a common point inside \(P\). What is the maximum number of such a subdivision that can contain isosceles triangles whose two sides are good?

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