Extremal Graph Theory and Ramsey Theory · Easy problem

What is the Ramsey number $R(2,7)$ (the minimum $n$ such that every 2-coloring of $K_n$ contains a red edge or a blue $K_7$)?