Extremal Graph Theory and Ramsey Theory · Challenge problem

For a random red/blue coloring of $K_n$, the expected number of monochromatic $K_5$'s is $\binom n5\,2^{1-10}$. What is the largest $n$ for which this is less than $1$ (so that $R(5,5)>n$)?