Eulerian and Hamiltonian Graphs · Challenge problem

In the cube graph $Q_3$ (vertices are the $3$-bit strings, edges join strings that differ in one bit), how many distinct Hamiltonian paths run from $000$ to its antipodal vertex $111$ (the vertex differing in all three bits)?