Eulerian and Hamiltonian Graphs · Easy problem

The complete graph $K_4$ has vertices $A,B,C,D$ and all $6$ edges. Counting a cycle and the same cycle traversed backward as the SAME Hamiltonian cycle, how many distinct Hamiltonian cycles does $K_4$ have?