Transformations · Challenge problem

Square $ABCD$ has $8$ symmetries (rotations and reflections that map the square onto itself), which can be viewed as permutations of its $4$ vertices. For how many of these $8$ symmetries does EVERY vertex move to a different vertex (none stays in place)?