Isomorphism and Subgraphs · Superchallenge problem

The $3$-dimensional hypercube $Q_3$ has vertices $\{0,1\}^3$ and edges between strings differing in exactly one coordinate (a $3$-regular graph on $8$ vertices with $12$ edges). How many automorphisms does $Q_3$ have?