
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
Given a family of sets \(\{A_{1}, A_{2}, \ldots, A_{n}\}\) that satisfies the following conditions:
(1) Each set \(A_{i}\) contains exactly 30 elements;
(2) For any \(1 \leq i < j \leq n\), the intersection \(A_{i} \cap A_{j}\) contains exactly 1 element;
(3) The intersection \(A_{1} \cap A_{2} \cap \ldots \cap A_{n} = \varnothing\).

Find the maximum number \(n\) of such sets.

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