Let there be $n$ people with seats marked $1$ to $n$. Let $p_k$ be the number of arrangements such that exactly $k$ persons go to their designated seat (the $i$ th person is designated seat number $i$) and the remaining do not.
Show that $$\sum_{k = 0}^n k*p_k = n!$$
We have for permutations with fixed points marked the combinatorial class
$$\def\textsc#1{\dosc#1\csod} \def\dosc#1#2\csod{{\rm #1{\small #2}}} \textsc{SET}(\mathcal{U}\mathcal{Z} + \textsc{CYC}_{\ge 2}(\mathcal{Z})).$$
This gives the mixed generating function
$$G(z, u) = \exp\left(uz + \sum_{q\ge 2} \frac{z^q}{q}\right) = \exp\left(uz-z + \log\frac{1}{1-z}\right) \\= \frac{1}{1-z} \exp(uz-z).$$
The desired quantity is then given by (the term $u^k z^n/n!$ representing a permutation of $n$ elements with $k$ fixed points) should contribute $k z^n/n!$)
$$n! [z^n] \left. \frac{\partial}{\partial u} G(z, u) \right|_{u=1} \\ = n! [z^n] \left. \frac{1}{1-z} \exp(uz-z) z \right|_{u=1} \\ = n! [z^n] \frac{z}{1-z}.$$
This is zero for $n=0$ and evaluates to
$$\bbox[5px,border:2px solid #00A000]{n!}$$
otherwise.