Directed Graphs and Network Flows · Challenge problem

Five teams $1,\dots,5$ play a round robin where team $i$ beats team $j$ for every pair $i<j$, EXCEPT that team $5$ beats team $1$ instead of the reverse. A Hamiltonian path visits every team exactly once, always moving winner-to-loser. How many different Hamiltonian paths does this tournament have?