Given a positive integer number $n$, determine the maximum number of edges a triangle-free Hamiltonian simple graph on $n$ vertices may have.