elementary number theory - Prove that if $(n-1)!equiv-1 mod n$ then $n$ is prime.

Let n be a natural number, $n\ge 2$. Prove that if $(n-1)!\equiv-1 \mod n$ then $n$ is prime. I tried few things but I my skills in equations modulo $n$ are not well enough. I would really appreciate your help.