Extremal Graph Theory and Ramsey Theory · Challenge problem

What is the smallest $n$ such that every red/blue coloring of the edges of $K_n$ contains a monochromatic $4$-cycle?