MathNet 2011 Question 13

Find all integers $n$, $n \geq 2$, such that the numbers $1!$, $2!$, $\ldots$, $(n-1)!$ give distinct remainders when divided by $n$.