Cosets and Lagrange's Theorem · Hard problem

A mechanical combination puzzle has $2520$ distinct configurations, forming a group $G$ of order $2520$ under its allowed moves. A particular repeated move returns the puzzle to its starting configuration after exactly $56$ repetitions, and no fewer. Letting $H$ be the cyclic subgroup of moves generated by this one move, what is $[G:H]$?