Question 75
A dodecahedron and a vertex $X$ of the dodecahedron are given. An ant started from $X$, walked along the edges of the dodecahedron, passing each of the vertices of the dodecahedron except $X$ just once, and returned to $X$. How many such routes exist? We consider a route and its reversal to be different.