Eulerian and Hamiltonian Graphs · Easy problem

The cube graph $Q_3$ is the $3$-dimensional hypercube: it has $8$ vertices (the $3$-bit strings $000, 001, 010, \ldots, 111$) and an edge between every pair of strings that differ in exactly one bit. Does $Q_3$ have an Euler circuit?