Eulerian and Hamiltonian Graphs · Challenge problem

In the complete graph $K_6$ on $6$ labeled vertices, how many distinct Hamiltonian cycles are there (two cycles counted as the same if they visit the vertices in the same cyclic order, forwards or backwards)?