Eulerian and Hamiltonian Graphs · Challenge problem

How many Hamiltonian cycles (cycles passing through all $6$ vertices) does $K_{3,3}$ contain?