Extremal Graph Theory and Ramsey Theory · Superchallenge problem

For a random red/blue coloring of $K_n$, the expected number of monochromatic $K_{10}$'s is $\binom n{10}2^{1-45}$. What is the largest $n$ for which this expectation is less than $1$?