Many Red Triangles

Given $2n$ points in the plane ($n > 1$), no three collinear, all segments between pairs are drawn and some $n^2 + 1$ of them are colored red. Prove that there are at least $n$ triangles with all three sides red.