
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 set $A_n = \{1, 2, 3, \ldots, n\}$, define a mapping $f: A_n \rightarrow A_n$ that satisfies the following conditions:
① For any $i, j \in A_n$ with $i \neq j$, $f(i) \neq f(j)$;
② For any $x \in A_n$, if the equation $x + f(x) = 7$ has $K$ pairs of solutions, then the mapping $f: A_n \rightarrow A_n$ is said to contain $K$ pairs of "good numbers." Determine the number of such mappings for $f: A_6 \rightarrow A_6$ that contain 3 pairs of good numbers.

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