KöMaL 2019 B5035

The edges of a complete graph on $n\ge 8$ vertices are coloured in two colours. Prove that the number of cycles formed by four edges of the same colour is more than $\frac{{(n-5)}^4}{64}$.