5. Let $a_{1}, a_{2}, \cdots, a_{6}$ be any permutation of $1,2, \cdots, 6$, and $f$ be a one-to-one mapping from $\{1,2, \cdots, 6\}$ to $\{1,2, \cdots, 6\}$, satisfying
$$
f(i) \neq i, f(f(i))=i(i=1,2, \cdots, 6) .
$$

Consider the number table
$$
A=\left[\begin{array}{cccccc}
a_{1} & a_{2} & a_{3} & a_{4} & a_{5} & a_{6} \\
f\left(a_{1}\right) & f\left(a_{2}\right) & f\left(a_{3}\right) & f\left(a_{4}\right) & f\left(a_{5}\right) & f\left(a_{6}\right)
\end{array}\right] .
$$

If the number tables $M$ and $N$ differ in at least one position, then $M$ and $N$ are considered two different number tables. The number of different number tables that satisfy the conditions is $\qquad$ (answer with a number).