Fermat, Euler and Wilson · Superchallenge problem

How many integers $n$ with $1 \le n \le 420$ satisfy $n^n \equiv 1 \pmod 7$?