Extremal Graph Theory and Ramsey Theory · Superchallenge problem

What is the smallest $n$ such that every red/blue coloring of the edges of $K_n$ has a red path with $2$ edges or a vertex with $3$ blue edges?