Factorials and Legendre's three-square theorem

We provide a necessary and sufficient condition for $n!$ to be a sum of three squares. The condition is based on the binary representation of $n$ and can be expressed by the operation of an automaton.