
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
In an alphabet with $n>1$ letters, a word is defined as any finite sequence of letters where any two consecutive letters are different. A word is called "good" if it is not possible to delete all but four letters from it to obtain a sequence of the form $a a b b$, where $a$ and $b$ are different letters. Find the maximum possible number of letters in a "good" word.

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