
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
For an integer \( n \) ( \( n \geq 4 \) ), find the smallest integer \( f(n) \) such that for any positive integer \( m \), any subset of \( f(n) \) elements from the set \( \{m, m+1, \cdots, m+n-1\} \) contains at least three elements which are pairwise coprime.

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