
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 \( n \) (\( \geqslant 3 \)) be a positive integer, and \( M \) be an \( n \)-element set. Find the largest positive integer \( k \) that satisfies the following condition:

There exists a family \( \psi \) of \( k \) three-element subsets of \( M \) such that the intersection of any two elements in \( \psi \) (note: the elements of \( \psi \) are all three-element sets) is nonempty.

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